Codeforces Round 381 (Div. 2)
A
Alyona and copybooks
Codeforces
1300
原题
←B →
翻译中…

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.

翻译中…

Input

翻译中…

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

翻译中…

Output

翻译中…

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

翻译中…

Note

翻译中…

In the first example Alyona can buy $3$ packs of $1$ copybook for $3*a* = 3$ rubles in total. After that she will have $4$ copybooks which she can split between the subjects equally.

翻译中…

In the second example Alyuna can buy a pack of $2$ copybooks for $*b* = 1$ ruble. She will have $8$ copybooks in total.

翻译中…

In the third example Alyona can split the copybooks she already has between the $4$ subject equally, so she doesn't need to buy anything.

翻译中…

In the fourth example Alyona should buy one pack of one copybook.

翻译中…

样例

Input #1
1 1 3 4
Output #1
3
InputCopy OutputCopy
Input #2
6 2 1 1
Output #2
1
InputCopy OutputCopy
Input #3
4 4 4 4
Output #3
0
InputCopy OutputCopy
Input #4
999999999 1000000000 1000000000 1000000000
Output #4
1000000000
InputCopy OutputCopy
题目信息
题号
740A
时间限制
1 s
内存限制
256 MB
标签
暴力
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。