#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
	int N;
	int ans = 0;
	cin >> N;
	vector<long long> v(N);
	for (int i = 0; i < N;i++) { cin >> v[i]; }
	sort(v.begin(), v.end());
	long long temp = v[0];
	int count = 0;
	if (N == 1) { cout << 1 << endl;return 0; }
	for (int i = 1;i < N;i++) {
		if (temp == v[i]) { count++; continue; }
		else {
			if (count == 0) {
				ans++;
				temp = v[i];
				if (i == N - 1) { ans++; }
			}
			else {
				temp = v[i];
				count = 0;
				if (i == N - 1) { ans++; }
			}
		}
	}
	cout << ans << endl;
	return 0;
}