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).
from collections import deque
from collections import OrderedDict
import math
 
import sys
import os
from io import BytesIO
import threading
import bisect
 
 
import heapq

#sys.stdin = open("F:\PY\\test.txt", "r")
input = lambda: sys.stdin.readline().rstrip("\r\n") 



n = int(input())

ar = list(map(int, input().split()))
dp=[0]*4
for i in range(n):
    dp[ar[i]]+=1
if dp[1]+dp[2]==0 or dp[1]+dp[3]==0 or dp[2]+dp[3]==0:
    print(n)
else:
    print(n-max(dp[1],dp[2],dp[3]))
