import math

MOD = 10**9 + 7

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

count_nonzero = 0
digit = -1
for i in range(9):
    if c[i] > 0:
        count_nonzero += 1
        digit = i + 1

if count_nonzero == 1:
    d = digit
    K = 9 * MOD
    pow10n = pow(10, n, K)
    pow10n_minus_1 = (pow10n - 1) % K
    s = pow10n_minus_1 // 9
    res = (d * s) % MOD
    print(res)
else:
    factors = 1
    all_even = True
    for idx in [0, 2, 4, 6, 8]:
        if c[idx] != 0:
            all_even = False
            break
    if all_even:
        factors *= 2
    
    if c[4] == n:
        factors *= 5
    
    sum_S = 0
    for i in range(9):
        sum_S += (i + 1) * c[i]
    
    g = math.gcd(sum_S, 9)
    factors *= g
    
    print(factors % MOD)