#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf = (1 << 30);

int n;
ll ans, x[100010];

ll sq (ll x, ll v) {
	ll L = 1, R = inf + 1;
	while (L + 1 < R) {
		ll M = (L + R) >> 1;
		if ((ll)(pow(M, (1ll << v))) <= x)
			L = M;
		else
			R = M;
	}
	return L;
} 

int main () {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%lld", &x[i]);
	sort(x + 1, x + n + 1);
	for (int i = n; i; i--, inf = (ll)(sqrt(inf))) {
		if (inf == 1ll) {
			ans += i;
			break;
		}
		ans += sq(x[i], n - i);
	}
	printf("%lld\n", ans);
	return 0;
}