#include <bits/stdc++.h>

using namespace std;

const int N = 100010;

int n;
int a[N];
vector<int> c[N];

int main (){
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	sort(a + 1, a + n + 1);
	reverse(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		int j = a[i];
		while(j != 1) {
			c[i].push_back(j);
			j = (int)sqrt(j);
		}
	}
	long long ans = 0;
	for (int i = 1; i <= n; i++) {
		if (c[i].size() >= i){
			ans += c[i][i - 1];
		} else {
			ans += 1;
		}
	}
	printf("%lld\n", ans);
	return 0;
}