B"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. 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k2, xe2 x80 x89k3, xe2 x80 x89k5, xe2 x80 x89k6 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895 xc2 xb7106). Print one integer -- maximum possible sum of Anton's favorite integers that can be composed using digits from the box. 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 xe2 x80 x89+ xe2 x80 x89256 xe2 x80 x89+ xe2 x80 x89256 xe2 x80 x89+ xe2 x80 x8932 xe2 x80 x89= xe2 x80 x89800. 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. "...