A. Alyona and copybooks--思维水题

A. Alyona and copybooks

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 arubles, 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 ≤ 109).

Output

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

Examples

input

1 1 3 4

output

3

input

6 2 1 1

output

1

input

4 4 4 4

output

0

input

999999999 1000000000 1000000000 1000000000

output

1000000000

Note

In the first example Alyona can buy 3 packs of 1 copybook for 3a = 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.

题目链接：http://codeforces.com/contest/740/problem/A

必须的吐槽一下这个题，cf昨晚不按常理出牌啊，本想试试能不能拼个手速在房间里抢个一血，上来就看示例，平常都是看了眼示例就懂了，昨晚咋回事？？？我耐下心来看了一遍题，恩，4的倍数，第一发，wa在第10组上了，恩，可能long long,我安慰自己（心中想着只有最边缘的数据才会用到long long，应该不会那么变态吧），再交，第二发，wa在第12组，还真有long long !!!好吧，但是我为什么又wa了呢，我看了看，n%4==余2和3的时候我没有分情况，恩，第三发，再交，wa（12），这个12组数据好硬啊，但是哪错了呢，啊，把2打成3了。。。恩，再交，第四发，Q^Q，不容易啊，终于过了=_=|||,我的一血梦啊！

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main()
{
    long long n,a,b,c;
    cin>>n>>a>>b>>c;
    long long k=n%4;
    if(k==0)
    {
        cout<<"0"<<endl;
    }
    else if(k==3)
    {
        if(a<=b+c&&a<=3*c)
            cout<<a<<endl;
        else if(b+c<=3*c)
            cout<<b+c<<endl;
        else 
            cout<<3*c<<endl;
    }
    else if(k==2)
    {
        if(2*a<=b&&2*a<=2*c)
        {
            cout<<2*a<<endl;
        }
        else if(b<=2*c)
        {
            cout<<b<<endl;
        }
        else
            cout<<2*c<<endl;
    }
    else if(k==1)
    {
        if((3*a<=(a+b))&&3*a<=c)
        {
            cout<<3*a<<endl;
        }
        else if(a+b<=c)
        {
            cout<<a+b<<endl;
        }
        else
            cout<<c<<endl;
    }
    return 0;
}