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