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.

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⁶).

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