Problem of the day
The first line contains an integer N i.e. number of flowers.
Next line will contain N integers, representing the types of N flowers.
Print minimum cost with which Oasis could buy all of flowers.
1 <= N <= 10^5
0 <= pi <= 10^4
5
1 2 3 17 10
3