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

const int N = 1e5 + 10;
int a[N];
int n;

bool cmp(int x, int y) {
	return (x > y);
}

int main() {
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i];
	sort(a + 1, a + 1 + n, cmp);
	long long ans = 0;
	for(int i = 1; i <= n; i++) {
		long long x = (1 << (i - 1));
		if(x > a[i]) {
			ans += (n - i + 1);
			break;
		}
		int l = 1, r = a[i];
		while(l < r) {
			int mid = (l + r + 1) / 2;
			if(pow(mid, x) > a[i]) r = mid - 1;
			else l = mid;
		}
		ans += l;
	}
	cout << ans;
	return 0;
}