import math

MOD = 10**9 + 7

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

# Check if all digits are the same
all_same = False
d = -1
for i in range(9):
    if c[i] == N:
        valid = True
        for j in range(9):
            if j != i and c[j] != 0:
                valid = False
                break
        if valid:
            all_same = True
            d = i + 1
            break

if all_same:
    # Compute d * (10^N - 1) / 9 mod MOD
    mod_val = 9 * MOD
    pow_10 = pow(10, N, mod_val)
    numerator = (pow_10 - 1) % mod_val
    part = (numerator // 9) % MOD
    res = (d * part) % MOD
    print(res)
else:
    sum_S = sum((i + 1) * count for i, count in enumerate(c))
    g = math.gcd(sum_S, 9)
    
    even_flag = True
    for i in range(9):
        if c[i] > 0 and (i + 1) % 2 != 0:
            even_flag = False
            break
    
    res = g * 2 if even_flag else g
    print(res % MOD)