#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
using namespace std;
using ll = long long;
int main() {
	int N;cin >> N;
	vector<ll> H(N);
	int K = 60;
	vector<int> CNT(K+1, 0);
	int mx =0;
	for (int i = 0;i < N;i++) {
		cin >> H[i];
		int lst = 0;
		for (int j = K;j >= 0;j--) {
			if (H[i] & (1LL << j)) {
				lst = j;
				break;
			}
		}
		CNT[lst]++;
		mx = max(mx, lst);
	}
	int sm = 0;
	for (int i = 0;i <= mx;i++) sm += max(0, CNT[i]-1);
	int res = mx + 1 + sm;
	cout << res << endl;
}