package main

import . "fmt"
import . "math/big"

const M = 1e9+7

func main() {
	const E int = 2e5
	ps := make([]int, E+1)
	ps[0] = 1
	for i := 1; i < len(ps); i++ {
		ps[i] = ps[i-1]*i%M
	}
	rs := make([]int, E+1)
	rs[E] = int(new(Int).ModInverse(NewInt(int64(ps[E])),NewInt(M)).Int64())
	for i := E;  i > 0; i-- {
		rs[i-1] = rs[i]*i%M
	}
	
	var n int
	Scan(&n)
	z := 0
	for i := 0; i < n; i++ {
		z = 10*z + 1
		z %= M
	}
	x := ps[n-1]
	y := 0
	for i := 1; i <= 9; i++ {
		var c int
		Scan(&c)
		x = x*rs[c]%M
		y += z*i%M*c%M
		y %= M
	}
	ans := x*y%M
	Println(ans)
}