#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890123456789LL
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

typedef long long cat;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N, B = 30;
	cin >> N;
	vector<int> ops(N, 0);
	vector<bool> pw2(N, false);
	for(int i = 0; i < N; i++) {
		int a;
		cin >> a;
		for(int j = 0; j < B; j++) {
			if(a == (1<<j)) pw2[i] = true;
			if(a > (1<<j)) ops[i] = j+1;
		}
	}
	vector<int> ans(B+1, N*B);
	ans[0] = 0;
	for(int i = 0; i < N; i++) {
		vector<int> ans_nw(B+1, N*B);
		for(int j = 0; j <= ops[i]; j++) for(int del = 0; del <= ops[i]; del++) {
			int add = ops[i]-j;
			if(!pw2[i] && add+del == 0) continue;
			ans_nw[ops[i]-del] = min(ans_nw[ops[i]-del], ans[j]+add);
		}
		ans = ans_nw;
	}
	cout << ans[0] << "\n";
	return 0;}

// look at my code
// my code is amazing
