#include<iostream>
#include<set>
using namespace std;
int main()
{
	multiset<int>m;
	int n, t;
	cin >> n;
	for (int i = 0; i < n; i++)     //插入multiset自动升序排列
	{
		cin >> t;
		m.insert(t);
	}
	int count = 0;
	multiset<int>::iterator it = (--m.end());//记录最后一个元素为最高楼层
	int top = *it;
	for (int i = 1; i <=top; i++)           
	{
	    count = m.count(i);            //统计这一层要下的人数
	    sum+=6;
		if (count != 0)
			sum += count + 5;
	}
	sum = sum +top * 4;       //下来需要的时间
	cout << sum << endl;
	return 0;
}