题库练习 Alyona and copybooks
← 上一题 下一题 →

A10754 | Alyona and copybooks

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Little girl Alyona is in a shop to buy some copybooks for school. She study four subjects so she wants to have equal number of copybooks for each of the subjects. There are three types of copybook's packs in the shop: it is possible to buy one copybook for $a$ rubles, a pack of two copybooks for $b$ rubles, and a pack of three copybooks for $c$ rubles. Alyona already has $n$ copybooks.

What is the minimum amount of rubles she should pay to buy such number of copybooks $k$ that $n+k$ is divisible by $4$ ? There are infinitely many packs of any type in the shop. Alyona can buy packs of different type in the same purchase.

输入格式

The only line contains $4$ integers $n$ , $a$ , $b$ , $c$ ( $1<=n,a,b,c<=10^{9}$ ).

输出格式

Print the minimum amount of rubles she should pay to buy such number of copybooks $k$ that $n+k$ is divisible by $4$ .

输入输出样例

输入 #1
1 1 3 4
输出 #1
3
输入 #2
6 2 1 1
输出 #2
1
输入 #3
4 4 4 4
输出 #3
0
输入 #4
999999999 1000000000 1000000000 1000000000
输出 #4
1000000000
C++ 编辑器
输入
输出