MOD = 10**9 + 7
inv9 = 111111112  # Modular inverse of 9 modulo MOD

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    c = list(map(int, input[1:10]))
    
    # Check if all digits are the same
    count_non_zero = 0
    digit = -1
    for i in range(9):
        if c[i] > 0:
            count_non_zero += 1
            digit = i + 1  # digits are 1-based
    if count_non_zero == 1 and c[digit-1] == N:
        # Compute the number as digit repeated N times mod MOD
        pow10 = pow(10, N, MOD)
        numerator = (pow10 - 1) % MOD
        res = digit * numerator % MOD
        res = res * inv9 % MOD
        print(res)
        return
    
    # Calculate sum_S
    sum_S = 0
    for i in range(9):
        sum_S += (i + 1) * c[i]
    
    d = gcd(sum_S, 9)
    
    # 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
    if all_even:
        d *= 2
    
    print(d % MOD)

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

if __name__ == "__main__":
    main()