def cmb(n, r, p):
  if (r < 0) or (n < r):
    return 0
  r = min(r, n - r)
  return fac[n]*finv[r]*finv[n-r]%p

def perm(n,r,p):
  if (r < 0) or (n < r):
    return 0
  return fac[n]*finv[n-r]%p

NN = 220000
MOD = pow(10,9) + 7

fac = [-1]*(NN+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(NN+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(NN+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,NN+1):
  fac[i] = fac[i-1]*i%MOD
  inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
  finv[i] = finv[i-1]*inv[i]%MOD


def main():
    N = int(input())
    C = list(map(int,input().split()))
    ans = 0
    for i in range(9):
        if C[i] == 0: continue
        val = 0
        base = 1
        for j in range(N):
            val += base*(i+1)
            val %= MOD
            base *= 10
            base %= MOD
        pattern = fac[N-1]
        #print(pattern)
        for j in range(9):
            if i == j:
                num = C[j] - 1
            else:
                num = C[j]
            if C[i] == 0: continue
            #print(num,finv[num])
            pattern *= finv[num]
            pattern %= MOD
        #print(val,pattern)
        temp = val*pattern%MOD
        ans += temp
        ans %= MOD
    print(ans)


if __name__ == '__main__':
    main()