AT_abc470_b [ABC470B] Monocolor

There are $ N $ balls. Each ball is painted in one of $ N $ colors: color $ 1 $ through color $ N $ . The color of the $ i $ -th ball $ (1\le i\le N) $ is $ C_i $ . In one operation, you can change the color of any one ball to any of the $ N $ colors. Find the minimum number of operations required to make all the balls the same color.

The input is given from Standard Input in the following format: > $ N $ $ C_1 $ $ C_2 $ $ \ldots $ $ C_N $

Output the answer.

### Sample Explanation 1 By changing the color of the first ball to $ 1 $ and the color of the third ball to $ 1 $ , you can make all the balls the same color. It is impossible to make all the balls the same color by changing the colors of fewer than two balls, so output $ 2 $ . ### Sample Explanation 2 All balls may have the same color from the beginning. ### Constraints - $ 1\le N\le 100 $ - $ 1\le C_i\le N $ - All input values are integers.