mod=10**9+7
def cmb(n,r):
  if r<0 or r>n:
    return 0
  return (g1[n]*g2[r]*g2[n-r])%mod
 
N=300000
g1=[1]*(N+3)
for i in range(2,N+3):
  g1[i]=g1[i-1]*i%mod
g2=[0]*len(g1)
g2[-1]=pow(g1[-1],mod-2,mod)
for i in range(N+1,-1,-1):
  g2[i]=g2[i+1]*(i+1)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
  inv[i]=g2[i]*g1[i-1]%mod

N=int(input())
ANS=0
C=list(map(int,input().split()))
for i in range(9):
  if C[i]==0:
    continue
  S=sum(C)-1
  x=i+1
  C[i]-=1
  for j in range(9):
    x=x*cmb(S,C[j])%mod
    S-=C[j]
  C[i]+=1
  ANS+=(pow(10,N,mod)-1)*pow(9,mod-2,mod)*x%mod
print(ANS%mod)