402906: GYM100942 G Pots

In a cooking pot shop sales decreased dramatically. Marketing managers of the shop did a research and found out that the reason was frying pans. People stopped buying pots as pans are both cheaper and more compact during storage. The Board of Directors made a decision to extent assortment and start selling also pans. The first batch is already ordered.

Warehouse logistics department was given a task to find a place for the new goods. Now there are N pots in the warehouse. Every pot has a diameter D_i. There is the only way to save space — it is possible to embed into any pot another one of a smaller diameter, into which in turn other can be embedded.

Help the logistics specialist to find a minimal number of pots in the warehouse in which all other pots can be embedded.

The first line contains a single number N (1 ≤ N ≤ 1000). The second line contains N integers D_i separated by spaces (1 ≤ D_i ≤ 10 000).

Output the obtained number.

5
7 5 2 5 2

2