S = input()
N = len(S)
if N == 1:
    print(S)
    print(S)
    exit()

M = 10 ** 9
P = 10 ** 9 + 7

ansM = 0
ansP = 0
for i in range(1, N):
    ansM += 9 * pow(10, (i-1)//2, M)
    ansM %= M
    ansP += 9 * pow(10, (i-1)//2, P)
    ansP %= P


size = (N + 1) // 2
dpM = [[[0] * 10 for _ in range(2)] for _ in range(size + 1)]
dpP = [[[0] * 10 for _ in range(2)] for _ in range(size + 1)]
dpM[0][0][0] = 1
dpP[0][0][0] = 1
for i in range(size):
    if i == 0:
        rng = range(1, 10)
    else:
        rng = range(10)
    nF = int(S[i])
    nL = int(S[size - i - 1])
    for j in range(2):
        for k in range(10):
            for d in rng:
                ni = i + 1
                nj = j
                nk = d
                if nj == 0:
                    if d > nF:
                        continue
                    if d > nL:
                        continue
                    if d < nF:
                        nj = 1
                dpM[ni][nj][nk] += dpM[i][j][k]
                dpM[ni][nj][nk] %= M
                dpP[ni][nj][nk] += dpP[i][j][k]
                dpP[ni][nj][nk] %= P

for i in range(2):
    for j in range(10):
        ansM += dpM[size][i][j]
        ansM %= M
        ansP += dpP[size][i][j]
        ansP %= P
ansM = (ansM - 1) % M
ansP = (ansP - 1) % P
print(ansM)
print(ansP)