MOD = 10**9 + 7

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

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

if all_same:
    # Compute (digit * (10^N - 1)/9) mod MOD
    mod9 = 9 * MOD
    pow10 = pow(10, N, mod9)
    numerator = (pow10 - 1) % mod9  # Ensure it's positive
    res = (digit * (numerator // 9)) % MOD
    print(res)
else:
    # Compute sum of digits
    S = sum((i + 1) * count for i, count in enumerate(c))
    
    # Determine sum contribution
    if S % 9 == 0:
        sum_contribution = 9
    elif S % 3 == 0:
        sum_contribution = 3
    else:
        sum_contribution = 1
    
    # Check if all digits are even
    all_even = True
    for i in range(9):
        if c[i] > 0 and (i + 1) % 2 != 0:
            all_even = False
            break
    
    even_contribution = 2 if all_even else 1
    
    gcd_val = sum_contribution * even_contribution
    print(gcd_val % MOD)