Mirko is in charge of bringing watermelons to the beach. He bought $A$ watermelons weighing $5\text{ kg}$ each, $B$ watermelons weighing $4\text{ kg}$ each, $C$ watermelons weighing $3\text{ kg}$ each, $D$ watermelons weighing $2\text{ kg}$ each, and $E$ watermelons weighing $1\text{ kg}$ each. To carry these watermelons, he will use bags that have a maximum load capacity of $5\text{ kg}$.

It is necessary to determine the minimum number of bags Mirko needs to buy to carry all the watermelons.

Mirko will carry as many watermelons in each bag as possible without exceeding the capacity, he will not cut the watermelons into smaller pieces, and he will not put bags inside other bags.

Input

The first line contains five integers from the problem description $A, B, C, D,$ and $E$ ($0 \le A, B, C, D, E \le 1000$).

Output

In the first and only line, write the number of bags Mirko needs to buy.

Examples

Input 1

5 0 0 0 0

Output 1

5

Input 2

0 0 0 0 5

Output 2

1

Input 3

0 10 0 10 3

Output 3

15

Input 4

1 1 5 4 3

Output 4

7