import os,sys,random,threading
#sys.exit() 退出程序
#sys.setrecursionlimit(10**6) #调整栈空间
from random import randint,choice,shuffle
#randint(a,b)从[a,b]范围随机选择一个数
#choice(seq)seq可以是一个列表,元组或字符串,从seq中随机选取一个元素
#shuffle(x)将一个可变的序列x中的元素打乱
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,迭代对象)
from bisect import bisect_left,bisect_right
#bisect_left(x) 大于等于x的第一个下标
#bisect_right(x) 大于x的第一个下标
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)用a序列生成一个累积迭代器，一般list化前面放个[0]做前缀和用
#combinations(a,k)a序列选k个 组合迭代器
#permutations(a,k)a序列选k个 排列迭代器
from heapq import  heapify,heappop,heappush
#heapify将列表转为堆
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#小写字母，大写字母，十进制数字
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceil向上取整，floor向下取整 ，sqrt开方 ，factorial阶乘
from decimal import Decimal,getcontext
#Decimal(s) 实例化Decimal对象,一般使用字符串
#getcontext().prec=100 修改精度
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = 1<<60
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)]  # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)]  # →↘↓↙←↖↑↗


MOD=mod = 10**9+7
N=3*10**5+1
fac = [1]*N  #fac[i] i的阶乘
ifac = [1]*N #ifac[i] i的阶乘 的逆元
inv = [0]*N  #inv[i]  i的逆元
inv[1]=1 
for i in range(2, N):
    fac[i] = fac[i-1]*i%mod
    inv[i] = (mod - mod // i) * inv[mod % i] % mod
    ifac[i] = ifac[i-1]*inv[i]%mod

def C(n: int, k: int) -> int:  #不重复组合数，n个不同物品不重复无序的取出k个
    if n < 0 or k < 0 or n < k:
        return 0
    return ((fac[n] * ifac[k]) % MOD * ifac[n - k]) % MOD


n=ii()

a=[0]+li()

if n==1:
    for i in range(1,10):
        if a[i]:
            print(i)
            exit()


res=0



p=fac[n]

for i in range(1,10):
    p*=ifac[a[i]]
    p%=mod


tot=0

x=1

for _ in range(n):
    tot+=x
    tot%=mod
    x*=10
    x%=mod

#print(p,tot)    

for i in range(1,10):
    res+=p*i*a[i]*tot*inv[n]
    res%=mod


print(res)