#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;int n,a[N],ans;
bool cmp(int x,int y) {return x>y;}
int main()
{
	cin >> n;
	for (int i=1;i<=n;i++) cin >> a[i];
	sort(a+1,a+n+1,cmp);
	ans += a[1]+int(sqrt(a[2]))+int(sqrt(sqrt(a[3])));
	ans += sqrt(sqrt(sqrt(a[4])));if (n>6) ans += n-6;
	ans += sqrt(sqrt(sqrt(sqrt(a[5]))));
	ans += sqrt(sqrt(sqrt(sqrt(sqrt(a[6])))));
	cout << ans;
	return 0;
}