vj Fox and Box Accumulation

Description

Fox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. The i-th box can hold at most x_i boxes on its top (we'll call x_i the strength of the box).

Since all the boxes have the same size, Ciel cannot put more than one box directly on the top of some box. For example, imagine Ciel has three boxes: the first has strength 2, the second has strength 1 and the third has strength 1. She cannot put the second and the third box simultaneously directly on the top of the first one. But she can put the second box directly on the top of the first one, and then the third box directly on the top of the second one. We will call such a construction of boxes a pile.

Fox Ciel wants to construct piles from all the boxes. Each pile will contain some boxes from top to bottom, and there cannot be more than x_i boxes on the top of i-th box. What is the minimal number of piles she needs to construct?

Input

The first line contains an integer n (1 ≤ n ≤ 100). The next line contains n integers x₁, x₂, ..., x_n (0 ≤ x_i ≤ 100).

Output

Output a single integer — the minimal possible number of piles.

Sample Input

Input

3
0 0 10

Output

2

Input

5
0 1 2 3 4

Output

1

Input

4
0 0 0 0

Output

4

Input

9
0 1 0 2 0 1 1 2 10

Output

3

Hint

In example 1, one optimal way is to build 2 piles: the first pile contains boxes 1 and 3 (from top to bottom), the second pile contains only box 2.

In example 2, we can build only 1 pile that contains boxes 1, 2, 3, 4, 5 (from top to bottom).

题目大意：给出n个盒子，每个盒子有自己的抗压值，x1--xn,xi代表该盒子上面还可以放xi个盒子，然后给出xi的序列，问能放几摞                                                     。 基本思路：我对每一个xi进行哈希，求出每个抗压值相同的个数，因为已经给出了xi的范围，我从最小的0开始往上取盒子，在取盒子的过程中我定义一个ans作为当前这一摞盒子从上往下已经放了多少了。在进行取盒子的时候，如果当前的盒子的抗压值满足即大于等于ans的画，也就是我可以取这个盒子放到ans个盒子的下面，循环的次数就是摞数，。         

#include <iostream>
#include<cstring>
#include<cstdio>

using namespace std;

int a[105];

int main()
{
    int n,x;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        int  mx=-1;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&x);
            if(x>mx)mx=x;
            a[x]++;
        }
        int ans=0;
        int num=0;
        int sum=0;
        while(1)
        {
            ans=0;
            for(int i=0; i<=mx; i++)
            {
                while(a[i])
                {
                    if(i<ans)break;
                    else
                    {
                        a[i]--;
                        ans++;
                    }
                }
            }
            num+=ans;
            sum++;
            if(num==n)break;
        }
        printf("%d\n",sum);
    }
    return 0;
}