C-Boxes packing

C. Boxes Packing

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.

Mishka can put a box i into another box j if the following conditions are met:

• i-th box is not put into another box;
• j-th box doesn't contain any other boxes;
• box i is smaller than box j (ai < aj).

Mishka can put boxes into each other an arbitrary number of times. He wants to minimize the number of visible boxes. A box is called visible iff it is not put into some another box.

Help Mishka to determine the minimum possible number of visible boxes!

Input

The first line contains one integer n (1 ≤ n ≤ 5000) — the number of boxes Mishka has got.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the side length of i-th box.

Output

Print the minimum possible number of visible boxes.

Examples

input

3
1 2 3

output

1

input

4
4 2 4 3

output

2

Note

In the first example it is possible to put box 1 into box 2, and 2 into 3.

In the second example Mishka can put box 2 into box 3, and box 4 into box 1.

解题思路：首先是对所有的盒子进行从小到大的排序，然后再从第最小的盒子开始，往后找比它大同时里面又没有放下其他的盒子，然后找到一个之后，总的视线内的盒子就少一个，直到结束。

ac代码：

#include<stdio.h>
#include<string.h>
int n;
int ans;
int b[5005];
int vis[5005];
int main()
{
	scanf("%d", &n);
	ans = n;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &b[i]);
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			int t;
			if (b[j] < b[i])
			{
				t = b[j];
				b[j] = b[i];
				b[i] = t;
			}
		}
	}
	memset(vis, 0, sizeof(vis));
	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if (b[j] > b[i]&&vis[j]==0)
			{
				ans--;
				vis[j] = 1;
				break;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}