from itertools import combinations_with_replacement, permutations, combinations

# 逆元のテーブルを作成
def cmb(n, k, mod, fac, ifac):
    k = min(k, n - k)
    return fac[n] * ifac[k] * ifac[n - k] % mod


def make_tables(mod, n):
    fac = [1, 1]  # 階乗テーブル・・・(1)
    ifac = [1, 1]  # 逆元の階乗テーブル・・・(2)
    inverse = [0, 1]  # 逆元テーブル・・・(3)

    for i in range(2, n + 1):
        fac.append((fac[-1] * i) % mod)
        inverse.append((-inverse[mod % i] * (mod // i)) % mod)
        ifac.append((ifac[-1] * inverse[-1]) % mod)
    fac[0] = 0
    ifac[0] = 0
    return fac, ifac


def main():
    N = int(input())
    A = list(map(int, input().split()))
    lst = []
    for i in range(1, 10):
        lst += [i for _ in range(A[i - 1])]
    mod = 10 ** 9 + 7
    fac, ifac = make_tables(mod, 2 * 10 ** 5 + 10)
    ans = 0
    total = fac[N - 1]
    for i in range(1, 10):
        if A[i - 1] == 0:
            continue
        if total > fac[A[i - 1]]:
            total //= fac[A[i - 1]]
        else:
            total += mod
            total //= fac[A[i - 1]]
    # for k in range(N):
    for i in range(1, 10):
        ans += ((pow(10, N, mod) - 1) // 9) * i * A[i - 1]
        ans %= mod
        # print((pow(10, N, mod) - 1) // 9, i, A[i - 1])
    ans *= max(1, total)
    ans %= mod
    print(ans)


main()