// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <random>
#include <iomanip>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 2e5, inf = 1e9;
int a, cnt[65], rt[N + 5][60], c[65], s1[N * 4 + 5], w[N * 4 + 5], lzy[N * 4 + 5],
	mn[N * 4 + 5], t[N + 5][60], p[N + 5][60];
ll s[N + 5];
bool s0[N * 4 + 5];
queue<int> q[N + 5];

namespace seg {
	int w[N * 20 + 5], ls[N * 20 + 5], rs[N * 20 + 5], top;
	void add(int &n, int l, int r, int k) {
		++top;
		w[top] = w[n] + 1, ls[top] = ls[n], rs[top] = rs[n];
		n = top;
		if(l == r) return;
		int mid = (l + r) >> 1;
		if(k <= mid) add(ls[n], l, mid, k);
		else add(rs[n], mid + 1, r, k);
	}
	int ask(int n, int l, int r, int L, int R) {
		if(l >= L && r <= R) return w[n];
		int mid = (l + r) >> 1, res = 0;
		if(L <= mid) res += ask(ls[n], l, mid, L, R);
		if(mid < R) res += ask(rs[n], mid + 1, r, L, R);
		return res;
	}
}

#define ls n << 1
#define rs n << 1 | 1
void upd(int n, int k) {
	w[n] += k, lzy[n] += k;
}
void dw(int n) {
	upd(ls, lzy[n]), upd(rs, lzy[n]);
	lzy[n] = 0;
}
void add(int n, int l, int r, int L, int k) {
	if(l >= L) return upd(n, k);
	dw(n);
	int mid = (l + r) >> 1;
	if(L <= mid) add(ls, l, mid, L, k);
	add(rs, mid + 1, r, L, k);
	w[n] = min(w[ls], w[rs]);
}
void ins0(int n, int l, int r, int k) {
	if(l == r) {
		add(1, 1, a, k, 1);
		return s0[n] = 1, void();
	}
	int mid = (l + r) >> 1;
	if(k <= mid) ins0(ls, l, mid, k);
	else ins0(rs, mid + 1, r, k);
	s0[n] = s0[ls] & s0[rs];
}
void ins1(int n, int l, int r, int k, int p, int q) {
	if(l == r) {
		add(1, 1, a, k, -p);
		return s1[n] += p, mn[n] = q, void();
	}
	int mid = (l + r) >> 1;
	if(k <= mid) ins1(ls, l, mid, k, p, q);
	else ins1(rs, mid + 1, r, k, p, q);
	s1[n] = s1[ls] + s1[rs];
	mn[n] = min(mn[ls], mn[rs]);
}
int ask0(int n, int l, int r, int L, int R) {
	if(s0[n]) return 0;
	int mid = (l + r) >> 1, res = 0;
	if(l >= L && r <= R) {
		if(l == r) return l;
		if(!s0[ls]) return ask0(ls, l, mid, L, R);
		return ask0(rs, mid + 1, r, L, R);
	}
	if(L <= mid) res = ask0(ls, l, mid, L, R);
	if(res) return res;
	return mid < R ? ask0(rs, mid + 1, r, L, R) : 0;
}
int ask1(int n, int l, int r, int L, int R) {
	// cerr << l << ' ' << r << ' ' << w[n] << endl;
	if(w[n]) return 0;
	int mid = (l + r) >> 1, res = 0;
	if(l >= L && r <= R) {
		if(l == r) return l;
		dw(n);
		if(!w[ls]) return ask1(ls, l, mid, L, R);
		return ask1(rs, mid + 1, r, L, R);
	}
	dw(n);
	if(L <= mid) res |= ask1(ls, l, mid, L, R);
	if(res) return res;
	return mid < R ? ask1(rs, mid + 1, r, L, R) : 0;
}
int que(int n, int l, int r, int L, int R) {
	if(l >= L && r <= R) return mn[n];
	int mid = (l + r) >> 1, res = inf;
	if(L <= mid) res = min(res, que(ls, l, mid, L, R));
	if(mid < R) res = min(res, que(rs, mid + 1, r, L, R));
	return res;
}

void solve() {
	rep(i, 1, a * 4) mn[i] = inf;
	rep(i, 1, a) {
		++cnt[__lg(s[i])];
		t[i][__lg(s[i])] = 1;
		p[i][__lg(s[i])] = (1ll << __lg(s[i])) == s[i];
		rep(j, 0, 59) t[i][j] += t[i - 1][j], p[i][j] += p[i - 1][j];
	}
	rep(i, 1, 60) c[i] = cnt[i - 1] + c[i - 1];
	rep(i, 1, a) {
		int x = __lg(s[i]);
		ll y = s[i] - (1ll << x);
		rep(j, 0, 59) rt[i][j] = rt[i - 1][j];
		if(y > cnt[x] || (1ll << x) == s[i]) continue;
		int r = ask0(1, 1, a, c[x] + 1, c[x] + y);
		if(r) {
			ins0(1, 1, a, r);
			q[c[x] + y].push(i);
			ins1(1, 1, a, c[x] + y, 1, q[c[x] + y].front());
		}
		else {
			// if(i == 4) {
			// 	cerr << c[x] + y << ' ' << c[x + 1] << endl;
			// 	cerr << ask1(1, 1, a, c[x] + y, c[x + 1]) << '\n';
			// 	exit(0);
			// }
			r = ask1(1, 1, a, c[x] + y, c[x + 1]);
			assert(r);
			int R = ask0(1, 1, a, c[x] + 1, r);
			// cerr << c[x] + 1 << ' ' << r << ' ' << R << endl;
			if(R) ins0(1, 1, a, R);
			else {
				int z = s[que(1, 1, a, c[x] + 1, r)] - (1ll << x) + c[x];
				// assert(z - c[x] >= 1 && z <= c[x + 1]);
				// cerr << r << ' ' << z << ' ' << q[z].back() << ' ' << i << endl;
				seg::add(rt[i][x], 1, a, q[z].front());
				// assert(q[z].back() == que(1, 1, a, c[x] + 1, r));
				q[z].pop();
				ins1(1, 1, a, z, -1, siz(q[z]) ? q[z].front() : inf);
			}
			q[c[x] + y].push(i);
			ins1(1, 1, a, c[x] + y, 1, q[c[x] + y].front());
			// cerr << w[1] << endl;
		}
	}
}

void init(int N, const vector<ll> &S) {
	a = N;
	rep(i, 1, a) s[i] = S[i - 1];
	solve();
}
ll ask(int L, int R) {
	ll ans = 0;
	per(i, 59, 0) if(t[R][i] - t[L - 1][i]) {
		// cerr << i << ' ' << R << endl;
		ans = (1ll << i) + R - L + 1 + t[R][i] - t[L - 1][i];
		ans -= p[R][i] - p[L - 1][i];
		ans -= seg::ask(rt[R][i], 1, a, L, R);
		return ans;
	}
	assert(0);
}
vector<ll> askAll(int Q, const vi &L, const vi &R) {
	vector<ll> ans(Q);
	rep(i, 0, Q - 1) ans[i] = ask(L[i], R[i]);
	return ans;
}

// signed main() {
// 	freopen(".in", "r", stdin);
// 	freopen(".out", "w", stdout);
// 	ios::sync_with_stdio(0);
// 	cin.tie(0), cout.tie(0);
// 	int a, b, c;
// 	cin >> a >> b >> c;
// 	vector<ll> s;
// 	ll x, y;
// 	rep(i, 1, a) cin >> x, s.PB(x);
// 	// vector<ll> t;
// 	// rep(i, 761, 933) t.PB(s[i]);
// 	// init(934 - 762 + 1, t);
// 	// cout << ask(1, 934-761) << endl;
// 	// return 0;

// 	init(a, s);
// 	// cerr << "#@@#" << endl;
// 	rep(i, 1, b) {
// 		cin >> x >> y;
// 		cout << ask(x, y) << '\n';
// 	}
// 	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
// }