from math import gcd

mod = 10 ** 9 + 7

n = int(input())
c = list(map(int, input().split()))
g = 0
for i in range(9):
    for j in range(i + 1, 9):
        if c[i] and c[j]:
            g = gcd(g, 9 * (j - i))

res = 0
if g == 0:
    x = 0
    for i in range(9):
        for j in range(c[i]):
            x *= 10
            x += i + 1
            x %= mod
    print(x)
    exit()
for k in range(1, g + 1):
    if g % k:
        continue
    x = 0
    for i in range(9):
        for j in range(c[i]):
            x *= 10
            x += i + 1
            x %= k
    if x == 0:
        res = k
print(res % mod)