package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

var iost *Iost

type Iost struct {
	Scanner *bufio.Scanner
	Writer  *bufio.Writer
}

func NewIost(fp io.Reader, wfp io.Writer) *Iost {
	const BufSize = 2000005
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, BufSize), BufSize)
	return &Iost{Scanner: scanner, Writer: bufio.NewWriter(wfp)}
}
func (i *Iost) Text() string {
	if !i.Scanner.Scan() {
		panic("scan failed")
	}
	return i.Scanner.Text()
}
func (i *Iost) Atoi(s string) int                 { x, _ := strconv.Atoi(s); return x }
func (i *Iost) GetNextInt() int                   { return i.Atoi(i.Text()) }
func (i *Iost) Atoi64(s string) int64             { x, _ := strconv.ParseInt(s, 10, 64); return x }
func (i *Iost) GetNextInt64() int64               { return i.Atoi64(i.Text()) }
func (i *Iost) Atof64(s string) float64           { x, _ := strconv.ParseFloat(s, 64); return x }
func (i *Iost) GetNextFloat64() float64           { return i.Atof64(i.Text()) }
func (i *Iost) Print(x ...interface{})            { fmt.Fprint(i.Writer, x...) }
func (i *Iost) Printf(s string, x ...interface{}) { fmt.Fprintf(i.Writer, s, x...) }
func (i *Iost) Println(x ...interface{})          { fmt.Fprintln(i.Writer, x...) }
func isLocal() bool                               { return os.Getenv("NICKEL") == "BACK" }
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	if isLocal() {
		fp, _ = os.Open(os.Getenv("WELL_EVERYBODY_LIES_TOO_MUCH"))
	}
	iost = NewIost(fp, wfp)
	defer func() {
		iost.Writer.Flush()
	}()
	solve()
}
func solve() {
	s := iost.Text()
	iost.Println(f(s, mod10))
	iost.Println(f(s, mod17))
}
func f(s string, mod func(int) int) int {
	n := len(s)
	ss := make([]int, n)
	for i := 0; i < n; i++ {
		ss[i] = int(s[i] - '0')
	}
	ans := make([]int, n+1)
	pow10 := make([]int, n+1)
	pow10[0] = 1
	for i := 0; i < n; i++ {
		pow10[i+1] = mod(pow10[i] * 10)
	}
	for i := 1; i < n; i++ {
		ans[i] = mod(9 * pow10[(i-1)/2])
	}
	l := 0
	r := n - 1
	check := make([]int, n)
	for l <= r {
		check[l], check[r] = ss[l], ss[l]
		less := ss[l]
		if l == 0 {
			less--
		}
		if less > 0 {
			ans[n] += less * pow10[(r-l)/2]
			ans[n] = mod(ans[n])
		}
		l++
		r--
	}
	ans[n]++
	for i := 0; i < n; i++ {
		if ss[i] == check[i] {
			continue
		}
		if ss[i] < check[i] {
			ans[n]--
			break
		}
		break
	}
	sum := 0
	for i := 1; i <= n; i++ {
		sum += ans[i]
	}
	return mod(sum)
}
func mod10(x int) int {
	return x % 1000000000
}
func mod17(x int) int {
	return x % 1000000007
}