#include<iostream>
#include<vector>
#include<cmath>
#include<minmax.h>
#include<iomanip>
using namespace std;
int num2 = 0;
void countingSort(vector<long long int>& arr) {
	int max = *max_element(arr.begin(), arr.end());
	vector<int> count(max + 1, 0);
	for (int num : arr) {
		count[num]++;
	}
	for (int i = 0; i < max + 1; i++)
	{
		if (count[i] != 0)
		{
			num2++;
		}
	}
	int index = 0;
	for (int i = 0; i <= max; i++) {
		while (count[i] > 0) {
			arr[index++] = i;
			count[i]--;
		}
	}
}
int main()
{
	int n = 0;
	cin >> n;
	vector<long long>a(1,0);
	for (int i = 0; i < n; i++)
	{
		int q = 0;
		cin >> q;
		a.push_back(q);
	}
	countingSort(a);
	long long  num = n + 10 * a[n-1]+num2*5;
	cout << num;
}