#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

using mint = modint1000000007;
const i64 mod = 1000000007;

i64 mypow(i64 a, i64 b){
    i64 res = 1;
    while (b){
        if (b & 1){
            res *= a;
        }
        a *= a;
        b >>= 1;
    }
    return res;
}

int main(){
    int n;
    cin >> n;
    vector<int> c(9);
    cin >> c;
    int f = 0;
    rep(i, 9){
        f += (c[i] > 0? 1: 0);
    }
    vector<mint> dp(35);
    dp[0] = 1;
    rep(i, 34){
        dp[i + 1] = dp[i] * pow_mod(10, mypow(2, i), mod) + dp[i];
    }
    if (f == 1){
        mint ans = 0;
        rep(i, 9){
            if (c[i] > 0){
                vector<int> h;
                rep(j, 31){
                    if ((c[i] >> j) & 1){
                        h.push_back(j);
                    }
                }
                reverse(all(h));
                for (auto j: h){
                    ans += dp[j] * pow_mod(10, c[i] - (1 << j), mod);
                    c[i] -= 1 << j;
                }
                ans *= i + 1;
                cout << ans.val() << endl;
                return 0;
            }
        }
    }
    i64 d = 0;
    int odd = 0;
    int nfour = 0;
    rep(i, 9){
        d += i64(i + 1) * c[i];
        if (((i + 1) & 1) && c[i]) odd = 1;
        if (c[i] && ((i + 1) % 4)) nfour = 1;
    }
    if (d % 9 == 0){
        if (nfour == 0){
            cout << 36 << endl;
            return 0;
        }
        else if (odd == 0){
            cout << 18 << endl;
            return 0;
        }
    }
    if (d % 3 == 0){
        if (nfour == 0){
            cout << 12 << endl;
            return 0;
        }
        if (d % 9 == 0){
            cout << 9 << endl;
            return 0;
        }
        if (odd == 0){
            cout << 6 << endl;
            return 0;
        }
    }
    if (nfour == 0) return cout << 4 << endl, 0;
    if (d % 3 == 0) return cout << 3 << endl, 0;
    if (odd == 0) return cout << 2 << endl, 0;
    cout << 1 << endl;
}