import math

MOD = 10**9 + 7

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

digits_present = [i + 1 for i in range(9) if c[i] > 0]

if len(digits_present) == 1:
    digit = digits_present[0]
    inv9 = pow(9, MOD - 2, MOD)
    pow_10 = pow(10, n, MOD)
    term = (pow_10 - 1) * inv9 % MOD
    ans = (digit * term) % MOD
else:
    D = 0
    for d in digits_present:
        D = math.gcd(D, d)
    sum_S = sum((i + 1) * c[i] for i in range(9))
    G = math.gcd(sum_S, 9)
    g = math.gcd(D, 9)
    ans = (D * (G // g)) % MOD

print(ans)