Problem Description

There are an infinite number of coins with denominations of 1, 5, and 11 yuan.

You need to凑出 $n$ yuan using the fewest number of coins.

Input Format

A single line containing a positive integer $n$.

Output Format

A single line containing a positive integer, representing the minimum number of coins needed.

Sample Input and Output

Sample Input #1

15

Sample Output #1

3

Sample Input #2

12

Sample Output #2

2

Notes

Sample Explanation

For Sample Data 1, the optimal solution is $15 = 5 + 5 + 5$, using 3 coins.

For Sample Data 2, the optimal solution is $12 = 11 + 1$, using 2 coins.

Data Size and Constraints

For $100\%$ of the data, it is guaranteed that $n \leq 10^6$.

见题面 Input 部分

见题面 Output 部分