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

multiset < int > s;
int a[100005];

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