MOD = 10**9 + 7
max_n = 200000

# Precompute factorial and inverse factorial modulo MOD
fact = [1] * (max_n + 1)
for i in range(1, max_n + 1):
    fact[i] = fact[i-1] * i % MOD

inv_fact = [1] * (max_n + 1)
inv_fact[max_n] = pow(fact[max_n], MOD-2, MOD)
for i in range(max_n - 1, -1, -1):
    inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD

inv_9 = pow(9, MOD - 2, MOD)

n = int(input())
c = list(map(int, input().split()))

sum_d = 0
for i in range(9):
    sum_d += (i + 1) * c[i]
sum_d %= MOD

product_t = 1
for i in range(9):
    cnt = c[i]
    product_t = product_t * inv_fact[cnt] % MOD

T = fact[n] * product_t % MOD

inv_n = pow(n, MOD - 2, MOD)

pow_10_n = pow(10, n, MOD)
sum_10_terms = (pow_10_n - 1) * inv_9 % MOD

total = sum_d * T % MOD
total = total * inv_n % MOD
total = total * sum_10_terms % MOD

print(total)