#!/usr/bin/python2
# -*- coding: utf-8 -*-
# †
mod0 = 10**9
mod7 = 10**9 + 7

def minus1(a):
    n = len(a)
    for i in reversed(range(n)):
        if a[i] == 0:
            a[i] = 9
        else:
            a[i] -= 1
            break
    return a


# a以下の最大の回文数
# aの例: [1, 4, 1, 4, 2, 1, 3, 5, 6]
def largest_palnum(a):
    n = len(a)
    # 10, 100, 1000, 10000, ... は例外
    if n > 1 and a[0] == 1 and all(a[i]==0 for i in xrange(1, n)):
        return [9] * (n-1)
    m = (n + 1) / 2
    def _create(vl):
        vr = list(reversed(vl))
        if n & 1:
            vr.pop(0)
        return vl + vr
    r1 = _create(a[:m])
    if a >= r1:
        return r1
    r2 = _create(minus1(a[:m]))
    return r2


# s以下の回文数の個数
# s: 整数を文字列で
def count(s, mod):
    a = largest_palnum(map(int, s))
    N = len(a)
    res =  pow(10, N/2,     mod) - 1
    res += pow(10, (N-1)/2, mod) - 1
    M = (N + 1) / 2
    x = int(''.join(map(str, a[:M])))
    res += x - pow(10, M-1, mod) + 1
    res %= mod
    return res

###
s = raw_input()
res0 = count(s, mod0)
res7 = count(s, mod7)
print res0
print res7