A10569 | Anton and Digits

Recently Anton found a box with digits in his room. There are $k_{2}$ digits $2$ , $k_{3}$ digits $3$ , $k_{5}$ digits $5$ and $k_{6}$ 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_{2}$ digits $2$ , $k_{3}$ 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_{2}$ , $k_{3}$ , $k_{5}$ and $k_{6}$ — the number of digits $2$ , $3$ , $5$ and $6$ respectively ( $0<=k_{2},k_{3},k_{5},k_{6}<=5·10^{6}$ ).

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