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).
def minimum_replacements(n, sequence):
    # Step 1: Count the occurrences of each number in the sequence
    counts = [0, 0, 0]  # Initialize counts for numbers 1, 2, and 3

    for num in sequence:
        counts[num - 1] += 1  # Increment the count for the corresponding number

    # Step 2: Determine the majority number
    majority_num = counts.index(max(counts)) + 1

    # Step 3: Calculate the minimum number of replacements needed
    min_replacements = n - counts[majority_num - 1]

    return min_replacements

# Input
n = int(input())
sequence = list(map(int, input().split()))

# Output
print(minimum_replacements(n, sequence))
