#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("koba.in");
ofstream fout("koba.out");

int n, t1, t2, t3, t, i, s, a[1000001];
int b[1000001], k=1, nr, nrp, sp, ok;
int x1, x2, x3, J1, j2, j3;

int main(){
    fin >> n >> t1 >> t2 >> t3;
    b[1] = t1 % 10;
    b[2] = t2 % 10;
    b[3] = t3 % 10;
    for (i = 4; i <= n; i ++){
        t = t3 % 10 + t2 % 10 * (t1 % 10);
        t1 = t2 % 10;
        t2 = t3 % 10;
        t3 = t % 10;
        b[i] = t % 10;
        if (a[t3 * 100 + t2 * 10 + t1] != 0){
            ok = 1;
            k = a[t3 * 100 + t2 * 10 + t1];
            break;
        }
       a[t3 * 100 + t2 * 10 + t1] = i;

    }

    for(int ii = 1; ii <= k - 3; ii ++)
        s = s + b[ii];
    for(int ii = i - 1; ii >= k; ii --)
        sp = sp + b[ii];
    n = n - k + 3;
    nrp = n / (i - k);
    s = s + nrp * sp;
    nr = n % (i - k);
    k -= 2;
    while(nr > 0){
       s = s + b[k];
       k ++;
       nr --;
    }
    fout << s;
    return 0;
}