# 各数字ごとに、各桁に何回出るか考える、寄与分

N = int(input())
C = [0] + list(map(int, input().split()))

# nCr 高速化
def nCr(N, R, MOD):
    numerator = 1
    for n in range(N-R+1, N+1):
        numerator *= n
        numerator %= MOD
        #ここをnumerator *= n%MODだとアウト、ちゃんとmodされていかないので低速
    denom = 1
    for r in range(1, R+1):
        denom *= r
        denom %= MOD
    denom_inverse = pow(denom, MOD-2, MOD)
    return numerator * denom_inverse %MOD

mod = 10**9+7
total = 1
N_remainder = N
for i in range(1, 10):
    if C[i] > 0:
        total *= nCr(N_remainder, C[i], mod)
        total %= mod
        N_remainder -= C[i]


nCr_list = [0]
for i in range(1, 10):
    calc = total*C[i]//N
    nCr_list.append(calc)

ans = 0
for d in range(N):
    for i in range(10):
        ans += i*nCr_list[i]*(10**d)
        ans %= mod
print(ans%mod)