n = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7

fact = [1] * (n + 1)
inv = [1] * (n + 1)
finv = [1] * (n + 1)
for i in range(2, n + 1):
    fact[i] = fact[i - 1] * i % mod
    inv[i] = mod - inv[mod % i] * (mod // i) % mod
    finv[i] = finv[i - 1] * inv[i] % mod

sum_num = 0
for i in range(9):
    if A[i] == 0:
        continue
    res = fact[n - A[i]]
    for j in range(9):
        if i == j:
            continue
        if A[j] == 0:
            continue
        res *= finv[A[j]]
        res %= mod
    sum_num += (i + 1) * res * A[i] % mod
    sum_num %= mod
ans = 0
for i in range(n):
    ans += sum_num * pow(10, i, mod) % mod
    ans %= mod
print(ans)