ef48fa1f89d24b30d23ab20b7b82d3cd91f918f314d2103a42c46758063fe25e
// https://szkopul.edu.pl/problemset/problem/M5CruI5eCu8elnNFHuiXBrvV/statement/
#include <bits/stdc++.h>
// #define GARY_DBG
#define GARY_LIB
constexpr int sizik = 1000 * 1001;
#define ar std::array
typedef std::vector<std::vector<int>> _kra;
constexpr int floor_log2(uint32_t x) noexcept {
int res = 0;
if (x >= (1u << 16)) {
x >>= 16;
res += 16;
}
if (x >= (1u << 8)) {
x >>= 8;
res += 8;
}
if (x >= (1u << 4)) {
x >>= 4;
res += 4;
}
if (x >= (1u << 2)) {
x >>= 2;
res += 2;
}
if (x >= (1u << 1)) {
res += 1;
}
return res;
}
#if defined(__GNUC__) || defined(__clang__)
#define LIKELY(x) (__builtin_expect(!!(x), 1))
#define UNLIKELY(x) (__builtin_expect(!!(x), 0))
#else
#define LIKELY(x) (x)
#define UNLIKELY(x) (x)
#endif
constexpr int z_calc(uint32_t a) noexcept {
if (UNLIKELY(a == 0)) return 0;
int leading_zeros = __builtin_clz(a);
uint32_t aligned = a << leading_zeros;
return __builtin_clz(~aligned);
}
int z_cnt[1000];
void solve() {
int n;
std::cin >> n;
int Q = 0;
std::vector<int> v(n);
for (auto& a : v) {
std::cin >> a;
Q += floor_log2(a) + 2;
int z = z_calc(a);
z_cnt[z]++;
}
int kto = 0;
for (int i = 32; i > 0; i--) {
while (z_cnt[i] > 0) {
if (kto & 1) {
if (i == 1) {
z_cnt[0] += z_cnt[1];
z_cnt[1] = 0;
} else {
z_cnt[i]--;
z_cnt[i - 1]++;
}
} else {
z_cnt[i]--;
}
kto++;
}
}
Q -= z_cnt[0];
Q = 2 * Q - 1;
std::cout << Q << '\n';
}
int32_t main() {
#ifndef GARY_DBG
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
#endif
int t = 1;
// std::cin >> t;
for (; t > 0; t--) {
solve();
}
return 0;
}