#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    vector<long>v={1,3,4,7,6,10,8,15,13,16,12,22,14,22,21,31,18,31,20,36,29,34,24,46};
    int n=a.size();
    long sum=0;
    for(int i=0;i<n;i++)
    {
        sum+=v[a[i]-1];
    }
    return sum;

}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}