#include <bits/stdc++.h>
using namespace std;
int a[100001];
int f(int n,int s){
	while(s --){
		if(n == 1) return n;
		n = int(sqrt(n));
	}
	return n;
}
int main(){
	int n;
	cin >> n;
	for(int i = 1;i <= n;i ++) cin >> a[i];
	sort(a+1,a+n+1);
	long long ans = 0,s = 0;
	for(int i = n;i >= 1;i --){
		if(!a[i]) break;
		ans += a[i];
		s ++;
		a[i - 1] = f(a[i - 1],s);
	}
	cout << ans;
	return 0;
}