from math import gcd
import sys
input = sys.stdin.readline

def ones(N):
    return (pow(10, N, mod) - 1) * pow(9, mod-2, mod) % mod

mod = 10**9 + 7
N = int(input())
c = [0] + list(map(int, input().split()))
for d in range(1, 10):
    if c[d] == N:
        print(d * ones(N) % mod)
        exit()
ans = 1
total = sum(d * c[d] for d in range(1, 10))
if c[2] + c[4] + c[6] + c[8] == N:
    ans *= 2
if c[4] + c[8] == N:
    ans *= 2
if total % 3 == 0:
    ans *= 3
if total % 9 == 0:
    ans *= 3
# check divisibility by 27
s = 0
for d in range(1, 10):
    q, r = divmod(c[d], 3)
    s += d * 111 * q
    c[d] = r
t = ''.join(str(d) * c[d] for d in range(1, 10))
for i in range(0, len(t), 3):
    s += int(t[::-1][3*i:3*i+3][::-1])
if s % 27 == 0:
    ans *= 3
for i in range(1, 9):
    for j in range(i + 1, 10):
        if c[i] > 0 and c[j] > 0:
            a = 10 * j + i
            b = 10 * i + j
            d = a - b
            ans = gcd(ans, d)
print(ans)