#include <bits/stdc++.h> #include <atcoder/modint> using namespace std; using namespace atcoder; //#pragma GCC optimize("Ofast") #define reps(i,s,n) for(int i = s; i < n; i++) #define rep(i,n) reps(i,0,n) #define Rreps(i,n,e) for(int i = n - 1; i >= e; --i) #define Rrep(i,n) Rreps(i,n,0) #define ALL(a) a.begin(), a.end() using ll = long long; using vec = vector<ll>; using mat = vector<vec>; ll N,M,H,W,Q,K,A,B; string S; using P = pair<ll, ll>; using tp = tuple<ll, ll, ll>; const ll INF = (1LL<<60); template<class T> bool chmin(T &a, const T b){ if(a > b) {a = b; return true;} else return false; } template<class T> bool chmax(T &a, const T b){ if(a < b) {a = b; return true;} else return false; } template<class T> void my_printv(std::vector<T> v,bool endline = true){ if(!v.empty()){ for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" "; std::cout<<v.back(); } if(endline) std::cout<<std::endl; } ll fastpow(ll a, ll pw, ll mod){ ll res = 1; while(pw){ if(pw&1) (res *= a) %= mod; (a *= a) %= mod; pw /= 2; } return res; } ll fast111(ll a, ll len, ll mod){ // 1 <= a <= 9 ll res = 0; for(ll k = 1; k <= len; k <<= 1){ if(k&len) ((res *= fastpow(10, k, mod))+=a)%=mod; (a *= fastpow(10, k, mod) + 1)%=mod; } return res; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cin>>N; vec c(10, 0); rep(i, 9) cin>>c[i + 1]; auto calc = [&](ll mod){ ll res{}; reps(i, 1, 10) { ((res *= fastpow(10, c[i], mod)) += fast111(i, c[i], mod))%=mod; } return res; }; int g = 8 * 9 * 7 * 5; rep(i, 10) rep(j, i) if(c[i] > 0 && c[j] > 0) g = gcd(g, i - j); if(g > 10){ cout<<calc(1000000007)<<endl; }else{ ll res = 1; if(calc(3) == 0) res = 3; if(calc(9) == 0) res = 9; if(res == 9 && g%3 == 0 && calc(27) == 0) res = 27; for(ll p : {8, 4, 2}){ if(g%p == 0 && calc(p) == 0){ res *= p; break; } } for(ll p : {5, 7}) if(g%p == 0 && calc(p) == 0) res *= p; cout<<res<<endl; } }