# TLEした、もっとうまい式があるということだろう
# https://qiita.com/ryusuke920/items/41c266243fc4c4d5327f
# https://yukicoder.me/problems/no/1629/editorial

N = int(input())
C = [0] + list(map(int, input().split()))
mod = 10**9+7

base1 = (pow(10, N, mod)-1)*pow(9, mod-2, mod)

# nCrメモ化パッケージ
factorial = [1] #0分
inverse = [1] #0分
for i in range(1, N+1):
    factorial.append(factorial[-1]*i%mod)
    inverse.append(pow(factorial[-1], mod-2, mod))

def nCr_fast(N, R, MOD):
    if N < R or R < 0:
        return 0
    elif R == 0 or R == N:
        return 1
    return factorial[N]*inverse[R]*inverse[N-R]%MOD

base2 = factorial[N-1]
temp = 1
for i in range(1, 10):
    temp *= factorial[C[i]]
    temp %= mod
base3 = pow(temp, mod-2, mod)
base4 = 0
for i in range(1, 10):
    base4 += i*C[i]
    base4 %= mod

ans = (base1*base2*base3*base4)%mod
print(ans)