const MOD: usize = 1e9 as usize + 7;

fn power(base: usize, times: usize) -> usize {
    if times == 0 { return 1usize; }
    if times == 1 { return base; }
    let temp = power(base, times/2);
    temp * temp % MOD * power(base, times%2) % MOD
}

fn fact_inv(size: usize) -> (Vec<usize>, Vec<usize>) {
    let mut facts = vec![0usize; size+1];
    let mut fact_invs = vec![0usize; size+1];
    let mut invs = vec![0usize; size+1];
    facts[0] = 1;
    facts[1] = 1;
    fact_invs[0] = 1;
    fact_invs[1] = 1;
    invs[1] = 1;
    for i in 2..=size {
        facts[i] = facts[i-1] * i % MOD;
        invs[i] = MOD - invs[MOD % i] * (MOD / i) % MOD;
        fact_invs[i] = fact_invs[i - 1] * invs[i] % MOD;
    }
    (facts, fact_invs)
}

fn comb(n: usize, r: usize, facts: &Vec<usize>, fact_invs: &Vec<usize>) -> usize {
    facts[n] * fact_invs[r] % MOD * fact_invs[n-r] % MOD
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut cnts = String::new();
    std::io::stdin().read_line(&mut cnts).ok();
    let cnts: Vec<usize> = cnts.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let mut cnt_sum = vec![0usize; 10];
    for i in 0..9 { cnt_sum[i+1] = cnt_sum[i] + cnts[i]; }
    cnt_sum.remove(0);
    let mut p10s = vec![1usize; n];
    for i in 0..n-1 { p10s[i+1] = p10s[i] * 10 % MOD; }
    let p10sum = p10s.iter().fold(0usize, |x, &y| (x + y) % MOD);
    let modn = power(n, MOD-2);
    let (facts, fact_invs) = fact_inv(n+10);
    let total_pattern = (0..9).map(|i| comb(cnt_sum[i], cnts[i], &facts, &fact_invs)).fold(1usize, |x, y| x * y % MOD);
    let mut result = 0usize;
    for i in 1..=9usize {
        let use_pattern = total_pattern * cnts[i-1] % MOD * modn % MOD;
        result += use_pattern * p10sum % MOD * i % MOD;
    }
    println!("{}", result % MOD);
}