#include <bits/stdc++.h>
using namespace std;
long long a[100000 + 5];
int main()
{
	int n, sum = 0;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 1; i <= n - 1; i++)
		for (int j = 1; j <= n - i; j++)
			if (a[j] < a[j + 1]) swap(a[j], a[j + 1]);
	for (int i = 1; i <= n; i++)
	{
		sum += a[i];
		for (int j = 2; j <= n; j++)
		{
			a[i] = (int)sqrt(a[i]);
			a[i - 1] = a[1];
		}
		n--;
		sort(a + 1, a + n + 1);
		if (n == 0) break;
	}
	cout << sum;
	
	return 0;
}