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

int n, a[100010];
long long ans = 0;

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

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	sort(a + 1, a + n + 1, cmp);
	ans += a[1] + 0LL;
	for (int i = 2; i <= 10; i++) {
		int x;
		for (int j = 1; j <= i - 1; j++) {
			a[i] = sqrt(a[i]);
			x = a[i];
		}	
		ans += x + 0LL;
	}
	if (n > 10)
		ans += n - 10 + 0LL;
	printf("%lld\n", ans);
	return 0;
}