Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. 123-sequence

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere is a given sequence of integers *a*_{1}, *a*_{2}, ..., *a*_{n}, 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* ≤ 10^{6}). The second line contains a sequence of integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/28/2017 04:54:59 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|