C. easy math
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

binarycopycode is terrible at math. He always ask locytus for help. After his retirement and graduation, he no longer has the opportunity to participate in programming contests, so he begins to enjoy solving easy math problems.

It's now the year 2024, and he wants to know, for an array of length $$$n$$$ where each number is a power of 2, how many times you need to raise 2024 to a power so that it is greater than or equal to the product of all the numbers in the array.

$$$i.e.$$$ It is given an array $$$a$$$ of $$$n$$$ integers. Every integer $$$a_i$$$ in array $$$a$$$ is power of $$$2$$$. Find the minimum integer $$$b$$$ satisfied that $$$\prod_{i=1}^{n} a_i \leq 2024^b$$$.

Input

First line is $$$n$$$ $$$(1\leq n \leq 50)$$$ which indicate number of integers in the array $$$a$$$.

The following line contains $$$n$$$ space-separated integers $$$a_1,a_2,...,a_n$$$ $$$(a_i=2^{k_i}, 0\leq k_i\leq 10)$$$.

Output

Print the minimum $$$b$$$.

Example
Input
3
2 1 1024
Output
2