You are given an array of integers. Vasya can permute (change order) its integers. He wants to do it so that as many as possible integers will become on a place where a smaller integer used to stand. Help Vasya find the maximal number of such integers.

For instance, if we are given an array $[10, 20, 30, 40]$, we can permute it so that it becomes $[20, 40, 10, 30]$. Then on the first and the second positions the integers became larger ($20&gt;10$, $40&gt;20$) and did not on the third and the fourth, so for this permutation, the number that Vasya wants to maximize equals $2$. Read the note for the first example, there is one more demonstrative test case.

Help Vasya to permute integers in such way that the number of positions in a new array, where integers are greater than in the original one, is maximal.
The first line contains a single integer $n$ ($1 \leq n \leq 10^5$) — the length of the array.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \leq 10^9$) — the elements of the array.
7
10 1 1 1 5 5 3
4
5
1 1 1 1 1
0
6
300000000 200000000 300000000 200000000 1000000000 300000000
3
10
1 2 3 4 5 6 7 8 9 10
9
1
1
0
7
3 5 2 2 5 2 4
4
5
1 5 4 2 3
4
def msort(a, n):
    if n > 1:
        m = n // 2
        k = []
        t = []
        for i in range(m):
            k.append(a[i])
        for i in range(m, n):
            t.append(a[i])
        k = msort(k, m)
        t = msort(t, n - m)
        a = merge(a, k, t, m, n - m)
    return a

def merge(a, b, c, bl, cl):
    pos1, pos2, pos = 0, 0, 0
    while(pos1 < bl and pos2 < cl):
        if b[pos1] <= c[pos2]:
            a[pos] = b[pos1]
            pos += 1
            pos1 += 1
        else:
            a[pos] = c[pos2]
            pos += 1
            pos2 += 1
    while pos1 < bl:
        a[pos] = b[pos1]
        pos += 1
        pos1 += 1
    while pos2 < cl:
        a[pos] = c[pos2]
        pos += 1
        pos2 += 1
    return a

n = int(input())
k = [int(i) for i in input().split()]
k = msort(k, n)
j = 1
s = 0
for i in range(n - 1):
    while(j < n and k[i] >= k[j]):
        j += 1
    if j <= n - 1:
        if k[i] < k[j]:
            s += 1
            j += 1
print(s)
			   		  		  	  	 		   	 				