题目描述

In the Kingdom of JAG, only $1$-yen banknotes have been issued so far. However, due to the increase in the circulation of banknotes, the kingdom has decided to renew its banknote system entirely. The new banknote system is represented by a sequence of positive integers $X = (X_1, X_2, \ldots, X_k)$. This means that the new system uses $k$ types of banknotes with denominations of $X_1, X_2, \ldots, X_k$ yen. You can decide the number of banknote types $k$ and their values $X_1, X_2, \ldots, X_k$ under the following restrictions:

• $k$ is a positive integer.
• $1 = X_1 < X_2 < \cdots < X_k$.
• $X_{i+1}$ must be a multiple of $X_i$ ($1 \leq i \leq k-1$).

In the Kingdom of JAG, goods are often traded at prices of $A$, $B$, or $C$ yen. Therefore, the inconvenience of the new banknote system is defined as:

(The minimum number of banknotes required to represent $A$ yen) + (The minimum number of banknotes required to represent $B$ yen) + (The minimum number of banknotes required to represent $C$ yen).

Your task is to find the minimum possible value of this inconvenience.

输入格式

The input is given in the following format:

• $1 \leq A < B < C \leq 10^8$
• All input values are integers.

输出格式

Output a single line with the minimum possible value of the inconvenience for the new banknote system.

6 11 15

6

99999959 99999971 99999989

11