## Algorithm

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 2k3 digits 3k5 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 2k3 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 k2k3k5 and k6 — the number of digits 235 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
Copy
`5 1 3 4`
output
Copy
`800`
input
Copy
`1 1 1 1`
output
Copy
`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.

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <iostream>

using namespace std;

int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;

int cc = 0;

while(a && c && d) {
cc += 256;
a--;
c--;
d--;
}

while(a && b) {
cc += 32;
a--;
b--;
}

cout << cc << endl;

return 0;
}``````
Copy The Code &

Input

cmd
5 1 3 4

Output

cmd
800