Lazy Running

At HD University, you have to be able to run around the campus 24 times in a row. Otherwise, you will fail the physical education exam and get expelled from the university. According to the rules, you must keep your speed, and your total running distance should be at least $K$ meters.

There are four checkpoints on the campus, labeled $p\_1$, $p\_2$, $p\_3$ and $p\_4$. Every time you pass a checkpoint, you should swipe your card, and the distance between this checkpoint and the last checkpoint you passed is added to your total distance.

The system regards the four checkpoints as a circle: from checkpoint $p\_i$, you can only run to one of its neighbors, $p\_{i - 1}$ or $p\_{i + 1}$; $p\_1$ and $p\_4$ are also neighbors of each other. You can run along a straight or curved line between neighboring checkpoints, but it makes no difference for the system: only the distance between checkpoints is taken into account.

Checkpoint $p\_2$ is the nearest to the dormitory, so Little Q always starts and ends running at this checkpoint. Write a program to help Little Q find the shortest path such that the total running distance taken into account by the system is at least $K$ meters.

The first line of the input contains five integers $K$, $d\_{1, 2}$, $d\_{2, 3}$, $d\_{3, 4}$ and $d\_{4, 1}$ denoting the required distance and the distances between every pair of neighboring checkpoints ($1 \leq K \leq 10^{18}$, $1 \leq d \leq 3 \cdot 10^4$).

Print a single line containing a single integer: the length of the shortest path.