Codeforces 734B Anton and Digits

http://codeforces.com/contest/734/problem/B

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 k2 digits 2, k3 digits 3, k5 digits 5 and k6 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 k2 digits 2, k3 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 k2, k3, k5 and k6 — the number of digits 2, 3, 5 and 6 respectively (0 ≤ k2, k3, k5, k6 ≤ 5·106).

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.

题意：

给定 2 ,3, 5, 6 的个数，只能够组合为 32 和 256 两个数字，问可以达到的最大和。

思路：

水题吧，优先组合256昂。

AC CODE：

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define HardBoy main()
#define ForMyLove return 0;
using namespace std;
typedef __int64 LL;
const int MYDD = 1103;

int HardBoy {
	int k2, k3, k5, k6;//32,256
	scanf("%d %d %d %d", &k2, &k3, &k5, &k6);
	/*肯定优先组合256*/
	int cnt256 = min(k2, min(k5, k6));
	int ans = 256*cnt256;
	
	int cnt32 = min(k2-cnt256, k3);
	ans += 32*cnt32;
	
	printf("%d\n", ans);
	ForMyLove
}