#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int x, int y) {
	return x < y;
}
int main() {
	long long int n;
	cin >> n;
	long long int a[1000000];
	for (long long int i = 1; i <= n; i++) {
		a[i] = 0;
	}
	for (long long int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	long long int k[1000000], r = 1;
	for (long long int i = 1; i <= n; i++) {
		k[i] = 1;
	}
	sort(a + 1, a + n + 1, cmp);
	for (long long int i = 1; i <= n - 1; i++) {
		if (a[i] == a[i + 1]) {
			k[r]++;
		}
		else {
			r++;
		}
	}
	long long int sum = 0;
	for (long long int i = 1; i <= r - 1; i++) {
		if (k[i] >= k[i + 1])
			sum = sum + k[i + 1];
		else
			sum = sum + k[i];
	}
	cout << n - sum;
	return 0;
}