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

fact = [1] * (max(10, n + 1))
inv = [1] * (max(10, n + 1))
finv = [1] * (max(10, n + 1))
for i in range(2, max(10, 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

ans = sum([(i + 1) * A[i] for i in range(9)]) % mod
ans *= (pow(10, n, mod) - 1 + mod) * inv[9] % mod
ans %= mod
ans *= fact[n - 1]
ans %= mod
for i in range(9):
    ans *= finv[A[i]]
    ans %= mod
print(ans)