#include<iostream>
#include<vector>
#include<algorithm>

int main() {
	int num;
	std::vector<int> v;

	std::cin >> num;

	for (int i = 0; i < num; i++) {
		int n;
		std::cin >> n;
		v.push_back(n);
	}

	std::sort(v.begin(), v.end());

	int count = 0;
	for (int i = 0; i < num - 1; i++) {
		if (v[i] != v[i + 1]) count++;
		else {
			while (i < num - 1 && v[i] == v[i + 1])i++;
		}
	}
	if (v[num - 1] != v[num - 2])count++;
	std::cout << count << std::endl;

	return 0;
}