#B3635. Minimum Coin Change

    ID: 11294 Type: Default 1000ms 256MiB

Minimum Coin Change

Minimum Coin Change

Given unlimited coins of denominations 1, 5, and 11, determine the minimum number of coins required to sum exactly n units.

Formally, if you have an infinite supply of coins with values $1$, $5$, and $11$, find the minimum number of coins needed to make up $n$ units.

inputFormat

The input consists of a single integer n ($0 \leq n \leq 10^4$) representing the total amount to be formed.

outputFormat

Output a single integer representing the minimum number of coins required to form n units.

sample

15
3