import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    C = LI()
    Ans = 0
    Base = 1
    for n in range(N-1):
        Base = 10*Base + 1
        Base %= MOD
    #print(Base)
    def modinv(x):
        return pow(x, MOD - 2, MOD)
    MAX = 200100
    Fact = [0] * MAX
    Fact[0] = 1
    Fact[1] = 1
    for n in range(2, MAX):
        Fact[n] = (n * (Fact[n - 1])) % MOD
    #print((Fact[N + K] * modinv(Fact[N] * Fact[K])) % MOD)
    CSUM = sum(C)
    All = Fact[N]
    for c in range(9):
        All *= modinv(Fact[C[c]])
        All %= MOD
    #print(All)
    #print(All//N)
    for c in range(9):
        k = C[c]
        #print((All//N)*C[c]*(c+1)*Base)
        Ans += (All*modinv(N))*C[c]*(c+1)*Base
        Ans %= MOD
    print(Ans % MOD)
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！