#include <bits/stdc++.h>
using namespace std;
#define int long long
long long a[100005];
bool cmp(long long a, long long b) {
	return a > b;
}
long long n;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort (a + 1, a + 1 + n, cmp);
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		int x = a[i];
		for (int j = 1; j < i; j++) {
			x = (int)sqrt(x * 1.0);
			if (x == 1) break;
		}
		if (x == 1) {
			sum += (n - i + 1);
			break;
		}
		sum += x;
	}
	cout << sum;
	return 0;
}