Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Beautiful Paintings

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere 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*_{1}, *a*_{2}, ..., *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.

Examples

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.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/21/2019 01:52:36 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|