import math
mod=10**9+7
n=int(input())
c=list(map(int,input().split()))
cnt=[0]*9
for i in range(9):
  if c[i]>0:
    cnt[i]=1
if sum(cnt)==1:
  ans=pow(10,n,mod)-1
  ans*=pow(9,mod-2,mod)
  for i in range(9):
    if cnt[i]==1:
      ans*=i+1
  print(ans%mod)
  exit()
g=0
for i in range(9):
  for j in range(i+1,9):
    if cnt[i]>0 and cnt[j]>0:
      g=math.gcd(g,j-i)
g*=9
m=0
tmp=0
for i in range(9):
  m+=(i+1)*(pow(10,tmp+c[i],g*9)-pow(10,tmp,g*9))
  m%=g*9
  tmp+=c[i]
m//=9
print(math.gcd(m,g))