package main import ( "bufio" "fmt" "math" "os" "sort" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var wr = bufio.NewWriter(os.Stdout) func out(x ...interface{}) { fmt.Fprintln(wr, x...) } func getI() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getF() float64 { sc.Scan() i, e := strconv.ParseFloat(sc.Text(), 64) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getI() } return ret } func getS() string { sc.Scan() return sc.Text() } // min, max, asub, absなど基本関数 func max(a, b int) int { if a > b { return a } return b } func min(a, b int) int { if a < b { return a } return b } // min for n entry func nmin(a ...int) int { ret := a[0] for _, e := range a { ret = min(ret, e) } return ret } // max for n entry func nmax(a ...int) int { ret := a[0] for _, e := range a { ret = max(ret, e) } return ret } func chmin(a *int, b int) bool { if *a < b { return false } *a = b return true } func chmax(a *int, b int) bool { if *a > b { return false } *a = b return true } func asub(a, b int) int { if a > b { return a - b } return b - a } func abs(a int) int { if a >= 0 { return a } return -a } func lowerBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] >= x }) return idx } func upperBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] > x }) return idx } func mpow(p, n int) int { ret := 1 x := p for n != 0 { if n%2 == 1 { ret *= x ret %= mod } n /= 2 x = x * x % mod } return ret } const mod = int(1e9 + 7) func main() { defer wr.Flush() sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, math.MaxInt32) // this template is new version. // use getI(), getS(), getInts(), getF() n := getS() m := len(n) num := []int{1, 45} for i := 0; i < m; i++ { num = append(num, ((num[len(num)-1]+1)*45)%mod) } ans := 0 if m == 1 { ans = 0 } else { ans = num[m-1] } cnt := 1 for i := 0; i < m; i++ { a := int(n[i] - '0') ans += cnt * ((a - 1) * a / 2) * mpow(45, m-i-1) ans %= mod cnt = cnt * a % mod } ans += cnt ans %= mod out(ans) }