跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1706. 123-sequence

    ID: 1712 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 1 上传者: 标签>模拟编程与模拟入门难度共享题库Codeforces英文题面题目来源题面语言

123-sequence

题目描述

A. 123-sequence
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

There is a given sequence of integers a1,a2,...,an, 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≤106). The second line contains a sequence of integers a1,a2,...,an (1≤ai≤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.

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 1250 题。保留原作者与原赛事署名。