#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint1000000007;
ll gcd(ll a,ll b){
    if(b) return gcd(b,a%b);
    return a;
}

#include<array>
using dat = array<array<ll,2>,2>;

dat op(dat a,dat b,ll mod){
    dat e{};
    for(int i = 0;i<2;i++) for(int j = 0;j<2;j++) for(int k = 0;k<2;k++) e[i][j] = (e[i][j] + a[i][k] * b[k][j]) % mod;
    return e;
}

dat e(){
    dat a{};
    a[0][0] = a[1][1] = 1;
    return a;
}

dat ppow(dat a,ll k,ll mod){
    dat now = e();
    while(k){
        if(k&1) now = op(now,a,mod);
        a = op(a,a,mod);
        k >>= 1;
    }
    return now;
}
ll calc(ll n,int ni) {
    dat use{};
    use[0][0] = 10 % ni;
    use[0][1] = 1;
    use[1][1] = 1;
    use = ppow(use,n,ni);
    return use[0][1];
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<ll> c(10,0);
    for(int i = 1;i<=9;i++) cin>>c[i];
    {
        int cnt = 0;
        for(int i = 1;i<=9;i++) if(c[i]!=0) cnt++;
        if(cnt==1){
            mint ans = mint(10).pow(n);
            ans--;
            ans /= 9;
            for(int i = 1;i<=9;i++) {
                if(c[i]!=0) ans *= i;
            }
            cout<<ans.val()<<endl;
            return 0;
        }
    }
    ll ans = 0;

    if(n>=8){
        ans = 1;
        ll tmp = 1;
        ll sum = 0;
        ///for(int i = 1;i<=9;i++) sum += i * c[i];
        ll g = 0;
        for(int i = 1;i<=9;i++) if(c[i]!=0) g = gcd(g,i);
        if(g!=1){
            tmp = g;
            vector<ll> nc(10,0);
            for(int i = 1;i<=9;i++) nc[i/g] += c[i];
            swap(c,nc);
        }
        for(int i = 1;i<=9;i++) sum += i * c[i];
        if(sum%9==0) ans = 9;
        else if(sum%3==0) ans = 3;
        //cout<<sum<<endl;
        for(int i = 2;i<=81;i++){
            vector<int> use;
            for(int j = 1;j<=9;j++) if(c[j]!=0) use.push_back(j%i);
            sort(use.begin(),use.end());
            use.erase(unique(use.begin(),use.end()),use.end());
            if(use.size()!=1) continue;
            
            ll all = calc(n,i);

            all *= use[0];
            all %= i;
            if(all==0) {
                ll g = gcd(ans,i);
                ans /= g;
                ans *= i;
            }
        }
        ans *= tmp;
        cout<<ans<<endl;
    }else{
        vector<int> all;
        for(int i = 1;i<=9;i++) for(int j = 0;j<c[i];j++) all.push_back(i);
        sort(all.begin(),all.end());
        do{
            ll now = 0;
            for(int i:all) now = now * 10 + i;
            ans = gcd(ans,now);
        }while(next_permutation(all.begin(),all.end()));
        cout<<ans<<endl;
    }
}