mod = 10 ** 9 + 7
class Combinatorics:
    def __init__(self, n):
        self.n = n
        self.fa = [1] * (self.n * 2 + 1)
        self.fi = [1] * (self.n * 2 + 1)

        for i in range(1, self.n * 2 + 1):
            self.fa[i] = self.fa[i - 1] * i % mod

        self.fi[-1] = pow(self.fa[-1], mod - 2, mod)

        for i in range(self.n * 2, 0, -1):
            self.fi[i - 1] = self.fi[i] * i % mod

    def comb(self, n, r):
        if n < r:return 0
        if n < 0 or r < 0:return 0
        return self.fa[n] * self.fi[r] % mod * self.fi[n - r] % mod

    def perm(self, n, r):
        if n < r:return 0
        if n < 0 or r < 0:return 0
        return self.fa[n] * self.fi[n - r] % mod
        
    def combr(self, n, r):
        if n == r == 0:return 1
        return self.comb(n + r - 1, r)


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

C = Combinatorics(n)


ans = 0
for i in range(9):
    if c[i] == 0: continue
    c[i] -= 1
    cur = n - 1
    cnt = 1
    for j in c:
        cnt *= C.comb(cur, j)
        cnt %= mod
        cur -= j
    c[i] += 1
    ans += (i + 1) * cnt
    ans %= mod
print(ans * (pow(10, n, mod) - 1) * pow(9, mod - 2, mod) % mod)