Barrel#7375

Barrel

1 second

64 megabytes

Easy

Using two containers with capacities of $3$ liters and $5$ liters, you must collect $m$ liters of water in a $100$ -liter barrel so that the total number of pour operations into and out of the barrel is minimized.

For example, to obtain $7$ liters of water, you can pour $5$ liters into the barrel twice, and then pour out $3$ liters once. In total, three pour operations are performed.

Input

One non-negative integer $m (0 \leq m \leq 100)$ m~(0 \le m \le 100).

Output

Print the minimum number of pour operations.

Examples

Example 1

Loading

m (0 \leq m \leq 100)