#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ll n;
	cin>>n;
	vector<ll>a(n);
	for(int i = 0;i< n ;i++){
		cin>>a[i];
	}
	vector<int>b(n);
	for(int i = 0;i<n ;i++){
		b[i] = pow(2,a[i]);
	}
	int sum = accumulate(b.begin(),b.end(),0);
	
	int count = 0;
	for(int i = 31;i>=0;i--){
		if((sum>>i)&1)count++;
	}
	

	cout<<count;
	return 0;
}