#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/modint>
using mint = atcoder::modint;
const int LOG = 31;
void run_case() {
    int N;
    cin >> N;
    vector<int> C(10);
    rep(i, 9) cin >> C[i + 1];
    rep(i, 1, 10) if (C[i] == N) {
        mint::set_mod(1e9 + 7);
        mint ans = (mint::raw(10).pow(C[i]) - 1) * i;
        ans /= 9;
        cout << ans.val() << "\n";
        return;
    }
    ll G = 0;
    rep(i, 1, 10) rep(j, i + 1, 10) if (C[i] && C[j]) {
        G = gcd(G, 9 * (j - i));
    }
    ll ans = 1;
    vector<ll> D;
    for (ll d = 1; d * d <= G; d++) {
        if (G % d == 0) {
            D.pb(d);
            if (d * d < G) D.pb(G / d);
        }
    }
    for (ll cand : D) {
        mint::set_mod(cand);
        vector<mint> pw10(LOG);                               // pw10[i] = 10^(2^i)
        vector<vector<mint>> precalc(LOG, vector<mint>(10));  // precalc[i][s] := s * (10^(2^i))
        pw10[0] = 10;
        rep(i, 1, LOG) pw10[i] = pw10[i - 1] * pw10[i - 1];
        rep(i, 1, 10) precalc[0][i] = i;
        rep(i, 1, LOG) {
            rep(j, 10) {
                precalc[i][j] = precalc[i - 1][j] * pw10[i - 1] + precalc[i - 1][j];
            }
        }
        mint cur = 0;
        rep(i, 1, 10) {
            rep(j, LOG) if (C[i] >> j & 1) {
                cur *= pw10[j];
                cur += precalc[j][i];
            }
        }
        if (cur == 0) chmax(ans, cand);
    }
    cout << ans << "\n";
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    // cin >> T;
    while (T--) run_case();
    return 0;
}