Beautiful Painting

There are n pictures delivered for the new exhibition. The i-th painting has beauty a_i. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.

We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of a in any order. What is the maximum possible number of indices i (1 ≤ i ≤ n - 1), such that a_i + 1 > a_i.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of painting.

The second line contains the sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000), where a_i means the beauty of the i-th painting.

Output

Print one integer — the maximum possible number of neighbouring pairs, such that a_i + 1 > a_i, after the optimal rearrangement.

Example

Input

5
20 30 10 50 40

Output

4

Input

4
200 100 100 200

Output

2

Note

In the first sample, the optimal order is: 10, 20, 30, 40, 50.

In the second sample, the optimal order is: 100, 200, 100, 200.

#include<stdio.h>
#include<algorithm>
#define maxn 1000
using namespace std;
int a[maxn],v[maxn];
int main()
{
    int n,ans;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        for(int i=0;i<=n;i++)
            v[i]=1;
        ans=0;
        for(int i=0;i<n;i++){
            if(a[i]==a[i+1])
                v[ans]++;
            else ans++;
        }
        int sum=0;
        sort(v,v+ans);
        for(int i=0;i<ans-1;i++)
            sum+=v[i];
        printf("%d\n",sum);
    }
    return 0;
}