N = int(input())
C = tuple(map(int, input().split()))
MOD = 10 ** 9 + 7
MAX = 2 * 10 ** 5 + 10
modinv = lambda a, mod=MOD: pow(a, mod - 2, mod)
# https://tjkendev.github.io/procon-library/python/math/factorial.html から拝借しています。
fact = [1] * (MAX + 1)
rfact = [1] * (MAX + 1)
r = 1
for i in range(1, MAX + 1):
    fact[i] = r = r * i % MOD
rfact[MAX] = r = pow(fact[MAX], MOD - 2, MOD)
for i in range(MAX, 0, -1):
    rfact[i - 1] = r = r * i % MOD

ct = (pow(10, N, MOD) - 1) * modinv(9) % MOD
ans = 0
for i in range(1, 10):
    if not C[i - 1]:
        continue
    tmp = ct * i * fact[N - 1] % MOD
    for j, c in enumerate(C, 1):
        tmp *= rfact[c - 1] if i == j else rfact[c]
        tmp %= MOD
    ans += tmp
    ans %= MOD
print(ans)