There is a given sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>, 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.
The first line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>). The second line contains a sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 3).
var
    i,j,n,m,k2,k3,k:integer;
begin
    read(n);    
    for i:=1 to n do
    begin
    read(j);
    if j=3 then inc(k);
    if j=2 then inc(k2);
    if j=1 then inc(k3);
    end;
    writeln( n-max(k,max(k2,k3)));
end.