#include <iostream>
#include <algorithm>
#include <cmath> 
using namespace std;

#define int long long

const int N = 1e5 + 5;
int a[N];

int p(int x,int c)
{
	if (x == 0)
	{
		return 0;
	}
	if (c == 0)
	{
		return x;
	}
	return p(sqrt(x),c - 1);
}

signed main()
{
	int n,sum = 0;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	sort(a + 1,a + n + 1,greater<int>());
	for (int i = 1; i <= n; i++)
	{
		sum += p(a[i],i - 1);
	}
	cout << sum;
 	return 0;
}