import sys
input=lambda:sys.stdin.readline().rstrip()
mod=pow(10,9)+7
def inv(a,mod):
	rem=mod-2
	ans=1
	while rem:
		if rem%2:
			ans=(ans*a)%mod
		a=(a*a)%mod
		rem//=2
	return ans
def fact(a,mod):
	ans=1
	for i in range(1,a+1):
		ans=(ans*i)%mod
	return ans
		
N=int(input())
C=list(map(int,input().split()))
ans=[1,9]
for i in range(N):
	ans[0]=(ans[0]*10)%mod
ans[0]+=mod-1
ans[0]*=fact(N-1,mod)*sum([(i+1)*C[i] for i in range(9)])
ans[0]%=mod
for i in range(9):
	ans[1]=(ans[1]*fact(C[i],mod))%mod
print((ans[0]*inv(ans[1],mod))%mod)