import sys
input = sys.stdin.readline


def comb_preprocess(n, mod):
    fact = [1] * (n+1)
    fact_inv = [1] * (n+1)
    for i in range(1, n+1):
        fact[i] = i * fact[i-1] % mod
    fact_inv[n] = pow(fact[n], mod-2, mod)
    for i in range(1, n+1)[::-1]:
        fact_inv[i-1] = i * fact_inv[i] % mod

    def comb(n, k):
        if k < 0 or n < k:
            return 0
        return fact[n] * fact_inv[k] * fact_inv[n-k] % mod

    return fact, fact_inv, comb

mod = 10**9 + 7
N = int(input())
c = [0] + list(map(int, input().split()))
fact, fact_inv, comb = comb_preprocess(N, mod)
den = 1
for d in range(1, 10):
    den = den * fact_inv[c[d]] % mod
ans = 0
pow10 = [1] * N
for i in range(1, N):
    pow10[i] = 10 * pow10[i-1] % mod
for i in range(N):
    for d in range(1, 10):
        ans += d * pow10[i] * fact[N-1] * den * c[d]
        ans %= mod
print(ans)