import sys
#sys.setrecursionlimit(1000000)
input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
import itertools
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e10)
mod = int(1e9+7)

n = int(input())
c = lmp()
s = 0
for i in range(9):
    s += (i+1)*c[i]
u = 1
for i in range(n-1):
    u *= i +1
    u %= mod
ans = 0
for i in range(n):
    ans *= 10
    ans += u*s
    ans %= mod
for i in c:
    ans *= pow(math.factorial(i), mod-2, mod)
    ans %= mod
    #print(ans)
print(ans)