#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)


using mll = atcoder::static_modint<1000000007>;

ll GCD(ll a, ll b){ return b ? GCD(b,a%b) : a; }

ll powmod(ll n, ll i, ll MOD){
  if(i == 0) return 1 % MOD;
  ll r = powmod(n*n%MOD,i/2,MOD);
  if(i % 2 == 1) r = r * n % MOD;
  return r;
}

ll onesmod(ll n, ll MOD){
  if(n == 0) return 1 % MOD;
  ll r = onesmod(n/2,MOD);
  r = (r * powmod(10,n/2,MOD) + r) % MOD;
  if(n % 2 == 1) r = (r * 10 + 1) % MOD;
  return r;
}


int main(){
  ll N; cin >> N;
  ll C[9]; rep(i,9) cin >> C[i];
  set<ll> X;
  rep(i,9) if(C[i]) X.insert(i+1);
  if(X.size() == 1){
    ll x = *X.begin();
    mll ans = (mll(10).pow(N) - 1) / 9;
    ans = ans * x;
    cout << ans.val() << "\n";
    return 0;
  }

  ll ex = 0;
  const ll lcm10 = 2520;
  rep(d,9){
    ex = ex * powmod(10,C[d],lcm10) + onesmod(N,lcm10) * (d+1);
    ex %= lcm10;
  }

  ll mult = 8*7*5;
  mult = GCD(mult,ex);
  rep(j,9) rep(i,j) if(C[i] != 0 && C[j] != 0) mult = GCD(mult,j-i);
  ll sum = 0;
  rep(d,9) sum += ll(C[d]) * (d+1);
  sum = GCD(sum,9);
  cout << (mult * sum) << "\n";
  return 0;
}

struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;