158B. Taxi

*special problem/greedy/implementation, 1100, https://codeforces.com/problemset/problem/158/B

After the lessons n groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the i-th group consists of s~i~ friends (1 ≤ s~i~ ≤ 4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?

Input

The first line contains integer n (1 ≤ n ≤ 10^5^) — the number of groups of schoolchildren. The second line contains a sequence of integers $s_1,\hspace{0.17em}{s}_2,\hspace{0.17em}...,\hspace{0.17em}{s}_n(1\hspace{0.17em}\le \hspace{0.17em}{s}_i\hspace{0.17em}\le \hspace{0.17em}4)$. The integers are separated by a space, s~i~ is the number of children in the i-th group.

Output

Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.

Examples

input

5
1 2 4 3 3

output

4

input

8
2 3 4 4 2 1 3 1

output

5

Note

In the first test we can sort the children into four cars like this:

• the third group (consisting of four children),
• the fourth group (consisting of three children),
• the fifth group (consisting of three children),
• the first and the second group (consisting of one and two children, correspondingly).

There are other ways to sort the groups into four cars.

数“1,2,3,4”出现的次数，3、4 人一组的直接算一辆，2 人的算两个座位，计算 1 人、3 人的组数能否刚好配对（若刚好，则 1 人直接与 3 人拼），加 3向上取整后整除 4。

input()
 
a,b,c,d=map(input().count,('1','2','3','4'))
 
print(d+c+(b*2+max(0,a-c)+3)//4)