#include<bits/stdc++.h>
//#include<atcoder/all>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace atcoder;
//using namespace boost::multiprecision;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1e9 + 7;
const ll LINF=1ll<<60;
const int INF=1<<30;
int dx[]={0,1,0,-1,0,1,-1,1,-1};
int dy[]={0,0,1,0,-1,1,-1,-1,1};


ll fpow(ll a, ll n){
    ll x = 1;
    while(n > 0){
        if(n&1){
            x=x*a%mod;
        }
        a=a*a%mod;
        n >>= 1;
    }
    return x;
}

int main(){
    int n;cin >> n;
    vector<int> c(10, 0);
    /*
    for (int T = 1; T < 100000; T++) {
        vector<int> c(10, 0);
        auto SS = to_string(T);
        for (int i = 0; i < SS.length(); i++) {
            c[SS[i] - '0']++;
        }
        n = SS.length();
        if(c[0] > 0) continue;
        int g = T;
        sort(ALL(SS));
        do{
            int tmp = stoi(SS);
            g = gcd(g, tmp);
        }while(next_permutation(ALL(SS)));
        */
    int sum = 0;
    ll S = 0;
    for (int i = 0; i < 9; i++) {
        cin >> c[i + 1];
        sum += c[i + 1] > 0;
        S += c[i + 1] * (i + 1);
    }
    if(n < 10){
        string SS = "";
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < c[i]; j++) {
                SS += '0' + i;
            }
        }
        int g = stoi(SS);
        sort(ALL(SS));
        do{
            int tmp = stoi(SS);
            g = gcd(g, tmp);
        }while(next_permutation(ALL(SS)));
        cout << g << endl;
        return 0;
    }
    if(sum == 1){
        ll t = 0;
        for (int i = 0; i < 10; i++) {
            if(c[i] > 0){
                t = i;
                break;
            }
        }
        cout << t * (fpow(10, n) - 1 + mod) %mod * fpow(9, mod - 2) %mod << endl;
        /*
        if(t * (fpow(10, n) - 1 + mod) %mod * fpow(9, mod - 2) %mod != g){
            cout << t * (fpow(10, n) - 1 + mod) %mod * fpow(9, mod - 2) %mod << " ";
            cout << T <<  " " << g << endl;
        }
        */
        return 0;
        //continue;
    }
    ll t3 = 1;
    if(S % 3 == 0) t3 = 3;
    if(S % 9 == 0) t3 = 9;
    ll t2 = 1;
    bool f = true;
    for (int i = 1; i < 10; i+=2) {
        if(c[i] > 0) f = false;
    }
    if(f) t2 = 2;
    f = true;
    for (int i = 0; i < 10; i++) {
        if(i == 4 || i == 8) continue;
        if(c[i] > 0) f = false;
    }
    if(f) t2 = 4;
    /*
    if(t3 * t2 != g){
        for (int i = 0; i < 10; i++) {
            cout << c[i] << " ";
        }
        cout << endl;
        cout << T << " " << g << endl;
    }
    */
    cout << t3 * t2 %mod << endl;
    //}
    return 0;
}