There is a given sequence of integers?a1,?a2,?...,?an, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each other.

Input

The first line contains an integer?n?(1?≤?n?≤?106). The second line contains a sequence of integers?a1,?a2,?...,?an?(1?≤?ai?≤?3).

Output

Print the minimum number of replacements needed to be performed to make all the numbers in the sequence equal.

Examples

input

9
1 3 2 2 2 1 1 2 3

output

5

Note

In the example all the numbers equal to 1 and 3 should be replaced by 2.

-------------------------------------

判斷每個元素的數(shù)量，將最小的2個加起來就是所有的需要的信息了，（這里面用一下數(shù)組的排序功能）；

下面是代碼：