CF1214A.Optimal Currency Exchange

Andrew was very excited to participate in Olympiad of Metropolises. Days flew by quickly, and Andrew is already at the airport, ready to go home. He has $n$ rubles left, and would like to exchange them to euro and dollar bills. Andrew can mix dollar bills and euro bills in whatever way he wants. The price of one dollar is $d$ rubles, and one euro costs $e$ rubles.

Recall that there exist the following dollar bills: $1$, $2$, $5$, $10$, $20$, $50$, $100$, and the following euro bills — $5$, $10$, $20$, $50$, $100$, $200$ (note that, in this problem we do not consider the $500$ euro bill, it is hard to find such bills in the currency exchange points). Andrew can buy any combination of bills, and his goal is to minimize the total number of rubles he will have after the exchange.

Help him — write a program that given integers $n$, $e$ and $d$, finds the minimum number of rubles Andrew can get after buying dollar and euro bills.

安德鲁非常兴奋地参加了大都市奥林匹克竞赛。时光飞逝，安德鲁已抵达机场，准备回家。他手头还剩 $n$ 卢布，希望将这些钱兑换成美元和欧元纸币。安德鲁可以任意组合美元和欧元纸币。1 美元的价格为 $d$ 卢布，1 欧元的价格为 $e$ 卢布。

回忆一下，目前流通的美元纸币面额有：$1$、$2$、$5$、$10$、$20$、$50$、$100$；欧元纸币面额有：$5$、$10$、$20$、$50$、$100$、$200$（注意：本题中不考虑 $500$ 欧元纸币，因为货币兑换点很难找到这种面额的纸币）。安德鲁可以购买任意组合的纸币，其目标是使兑换后剩余的卢布总数最小。

请帮助他——编写一个程序，输入整数 $n$、$e$ 和 $d$，输出安德鲁在购买美元和欧元纸币后所能得到的最少剩余卢布数。

The first line of the input contains one integer $n$ ($1 \leq n \leq 10^8$) — the initial sum in rubles Andrew has.

The second line of the input contains one integer $d$ ($30 \leq d \leq 100$) — the price of one dollar in rubles.

The third line of the input contains integer $e$ ($30 \leq e \leq 100$) — the price of one euro in rubles.

输入的第一行包含一个整数 $n$（$1 \leq n \leq 10^8$）——安德鲁最初拥有的卢布金额。

输入的第二行包含一个整数 $d$（$30 \leq d \leq 100$）——一美元对应的卢布价格。

输入的第三行包含一个整数 $e$（$30 \leq e \leq 100$）——一欧元对应的卢布价格。

Output one integer — the minimum number of rubles Andrew can have after buying dollar and euro bills optimally.

输出一个整数——安德鲁在最优地购买美元和欧元纸币后所拥有的最少卢布数。

In the first example, we can buy just $1$ dollar because there is no $1$ euro bill.

In the second example, optimal exchange is to buy $5$ euro and $1$ dollar.

In the third example, optimal exchange is to buy $10$ dollars in one bill.

在第一个例子中，我们只能购买 $1$ 美元，因为没有面值为 $1$ 欧元的纸币。

在第二个例子中，最优的兑换方式是购买 $5$ 欧元和 $1$ 美元。

在第三个例子中，最优的兑换方式是一次性购买 $10$ 美元（使用一张纸币）。