#include <bits/stdc++.h>
long long n, x[100005], ans;
long long makesqrt(long long num, long long time) {
	if (time && num > 1) return makesqrt(sqrt(num), time - 1);
	return num;
}
int main() {
	scanf("%lld", &n);
	for (int i = 0; i < n; ++i) scanf("%lld", &x[i]);
	std::sort(x, x + n);
	for (int i = n - 1; i >= 0; --i) {
		if (makesqrt(x[i], n - i - 1) == 1) printf("%lld", ans + i + 1), exit(0);
		else ans += makesqrt(x[i], n - i - 1);
	}
	printf("%lld", ans);
}