#include <bits/stdc++.h>
using namespace std;

int a[100005];

int main()
{
    int n, t = 0, maxn = -1;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        maxn = max(maxn, a[i]);
//        cout << maxn << endl;
    }
    sort(a + 1, a + n + 1);
    for (int i = 1, cur = 1; i <= maxn; i++)
    {
        t += 6;
        if (a[cur] == i)
        {
            t += 5;
            while (a[cur++] == i)
            {
                t += 1;
            }
        }
    }
    t += maxn * 4;
    cout << t << endl;
    return 0;
}