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

def gcd(a,b):
    if b == 0:return a
    while True:
        r = a % b
        a = b
        b = r
        if r == 0:
            return a
d = 0
for i in range(9):
    for j in range(i+1,9):
        if c[i] and c[j]:
            d = gcd(d,j-i)
P = 10 ** 9 + 7
if d == 0:
    d = P
else:
    d *= 9 * 9
keta = 0
amari = 0
for i in range(9):
    if c[i] == 0:continue
    amari = (amari + pow(10,keta,d) * (pow(10,c[i],d)-1)%d*(i+1)) % d
    keta += c[i]
if d == P:
    print(amari*pow(9,P-2,P)%P)
else:
    print(gcd(d,amari)//9)