import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.buffer.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod

mod = 10**9 + 7
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

N = int(input())
c = [0] + li()

pow_10 = [1 for i in range(N)]
for i in range(1,N):
    pow_10[i] = 10 * pow_10[i-1] % mod

res = 0
for i in range(1,10):
    if c[i]==0:
        continue
    tmp = g1[N-1]
    for j in range(1,10):
        if j!=i:
            tmp *= g2[c[j]]
        else:
            tmp *= g2[c[j]-1]
        tmp %= mod
    for d in range(N):
        res += i * pow_10[d] * tmp
        res %= mod


print(res)