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

long long a[100005], n, cnt;

long long q(long long x, long long id) {
	long long ans = x;
	for (int i = 1; i <= id; i++) {
		ans = sqrt(ans);
		if (ans == 1) {
			break;
		}
	}
	return ans;
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for (long long i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	for (long long i = n; i >= 1; i--) {
		cnt += q(a[i], n - i);
	}
	cout << cnt;
	return 0;
}