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).
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - #
# IN THE NAME OF GOD
# C++ : Done.!
# Python 3 : Loading...

import math
import random
import sys
import time

#---------------------------------->    Programmer    :   Kadi   <----------------------------------#

t = int(input())
one = two = three = 0
s = input()
for i in range(0, len(s)):
    if s[i] == '1' : one = one + 1
    if s[i] == '2' : two = two + 1
    if s[i] == '3' : three = three + 1
print(t - max(one, max(two, three)))

# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - #
