#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
long long q[100010];
bool cmp(long long a,long long b) {
	return a > b;
}
int main()
{
	int n;
	long long c = 0;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		scanf("%d",&q[i]);
	}
	sort(q + 1,q + 1 + n,cmp);
	for (int i = 1; i <= n; ++i) {
		c += q[i];
		for (int j = i; j <= n; ++j) {
			q[j] = sqrt(q[j]);
		}
	}
	cout << c;
	return 0;
}