const MOD: usize = 1e9 as usize + 7; fn main() { let mut n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n = n.trim().chars().map(|c| c as usize - '0' as usize).collect::>(); let limit = n.len(); let mut edp = vec![vec![vec![0usize; 10]; 2]; limit]; let mut ldp = vec![vec![vec![0usize; 10]; 2]; limit]; edp[0][0][n[0]] = n[0]; for i in 0..n[0] { ldp[0][if i == 0 { 1 } else { 0 }][i] = i.max(1); } for i in 1..limit { for leading0 in 0..2 { for k in 0..10 { for nk in 0..10 { let nleading0 = if leading0 == 1 && nk == 0 { 1 } else { 0 }; if nk == n[i] { edp[i][nleading0][nk] += edp[i-1][leading0][k] * nk; edp[i][nleading0][nk] %= MOD; } else if nk < n[i] { ldp[i][nleading0][nk] += edp[i-1][leading0][k] * nk.max(nleading0); } ldp[i][nleading0][nk] += ldp[i-1][leading0][k] * nk.max(nleading0); ldp[i][nleading0][nk] %= MOD; } } } } // eprintln!("{}", (1..=99).map(|i| i.to_string().chars().map(|c| c as usize - '0' as usize).fold(1usize, |x, y| x * y)).sum::()); // for i in 0..limit { eprintln!("edp: {:?}", edp[i]); } // for i in 0..limit { eprintln!("ldp: {:?}", ldp[i]); } let result = edp[limit-1][0].iter().sum::() + ldp[limit-1][0].iter().sum::(); println!("{}", result % MOD); }