VK Cup 2012 Qualification Round 1B

B. Taxi

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 si friends (1 ≤ si ≤ 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 ≤ 105) — the number of groups of schoolchildren. The second line contains a sequence of integers s1, s2, ..., sn (1 ≤ si ≤ 4). The integers are separated by a space, si 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

Copy

5
1 2 4 3 3

output

Copy

4

input

Copy

8
2 3 4 4 2 1 3 1

output

Copy

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.

需要注意的是一个团的必须全在一辆车上

#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int n;
int k, m, ans, cns, res, l, q;
int main()
{
	cin >> n;

	for (int i = 0;i < n;i++)
	{
		cin >> a[i];
		if (a[i] == 4)
			k++;
		else if (a[i] == 3)
			m++;
		else if (a[i] == 2)
			ans++;
		else cns++;

	}
	if (cns > m)
		res = cns - m;
	k += m;//三人团已经满了
	//剩下res个一人团和ans二人团
	//如果二人团有空余需要将情况分开来，因为二人团可以拉一人团来凑数
	if (ans != 0)
	{
		if (ans == 1)
		{
			if (res <= 2)//一人团和二人团一辆
				k += 1;
			else if (res <= 4)//一人团多了一两个人的话
			{
				k += 2;
			}
			else
			{
				res -= 2;//拉到二人团里面去了剩下的单独拿出来组车
				if (res % 4 == 0)k += 1 + res / 4;
				else k += 1 + res / 4 + 1;
			}

		}
		else if (ans == 2)//二人团的车满了只需要考虑一人团的情况
		{
			if (res <= 4)
			{
				if (res == 0)
					k += 1;
				else
					k += 2;
			}
			else
			{
				if (res % 4 == 0)k += 1 + res / 4;
				else k += 1 + res / 4 + 1;
			}
		}
		else//二人团的个数很多
		{
			if (ans % 2 == 0)
			{
				k += ans / 2;
				if (res <= 4 && res != 0)
				{
					k += 1;
				}
				else
				{
					if (res % 4 == 0)k += res / 4;
					else k += res / 4 + 1;
				}
			}
			else//二人团个数奇数
			{
				k += ans / 2+1;
				res -= 2;
			      if(res>=0)
				{
					if (res % 4 == 0)k += res / 4;
					else k += res / 4 + 1;
				}
			}
		}
	}
	else//二人团个数为0，只要考虑一人团
	{
		if (res <= 4 && res != 0)k += 1;
		else
		{
			if (res % 4 == 0)
				k += res / 4;
			else k += res / 4 + 1;
		}
	}
	cout << k << endl;
	}

给我整麻了....... 调试了这么久，QAQ......我的期末考复习........