Codeforces 734B Anton and Digits【贪心】水题

B. Anton and Digits

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Anton found a box with digits in his room. There are k₂ digits 2, k₃ digits 3, k₅ digits 5 and k₆ digits 6.

Anton's favorite integers are 32 and 256. He decided to compose this integers from digits he has. He wants to make the sum of these integers as large as possible. Help him solve this task!

Each digit can be used no more than once, i.e. the composed integers should contain no more than k₂ digits 2, k₃ digits 3 and so on. Of course, unused digits are not counted in the sum.

Input

The only line of the input contains four integers k₂, k₃, k₅ and k₆ — the number of digits 2, 3, 5 and 6 respectively (0 ≤ k₂, k₃, k₅, k₆ ≤ 5·10⁶).

Output

Print one integer — maximum possible sum of Anton's favorite integers that can be composed using digits from the box.

Examples

Input

5 1 3 4

Output

800

Input

1 1 1 1

Output

256

Note

In the first sample, there are five digits 2, one digit 3, three digits 5 and four digits 6. Anton can compose three integers 256 and one integer 32 to achieve the value 256 + 256 + 256 + 32 = 800. Note, that there is one unused integer 2 and one unused integer 6. They are not counted in the answer.

In the second sample, the optimal answer is to create on integer 256, thus the answer is 256.

题目大意：

已知2356四个数的数量。只能组256或者是32两种数，随意分配组合，问最终的加和最大是多少。

思路：

贪心，能组256就不组32。

那么肯定是先组256，如果256已经组不出来了，那么就组32.

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define ll __int64
int main()
{
    ll a,b,c,d;
    while(~scanf("%I64d%I64d%I64d%I64d",&a,&b,&c,&d))
    {
        ll output=0;
        output+=256*min(min(a,c),d);
        ll tmp=min(min(a,c),d);
        a-=tmp;
        c-=tmp;
        d-=tmp;
        output+=32*min(a,b);
        printf("%I64d\n",output);
    }
}