Little X has met the following problem recently. 

Let's define f(x) as the sum of digits in decimal representation of number x (for example, f(1234) = 1 + 2 + 3 + 4). You are to calculate <image>

Of course Little X has solved this problem quickly, has locked it, and then has tried to hack others. He has seen the following C++ code: 
    
    
      
        ans = solve(l, r) % a;  
        if (ans <= 0)  
          ans += a;  
      
    

This code will fail only on the test with <image>. You are given number a, help Little X to find a proper test for hack.

Input

The first line contains a single integer a (1 ≤ a ≤ 1018).

Output

Print two integers: l, r (1 ≤ l ≤ r < 10200) — the required test data. Leading zeros aren't allowed. It's guaranteed that the solution exists.

Examples

Input

46


Output

1 10


Input

126444381000032


Output

2333333 2333333333333
from random import randint

def stupid(n):
    ret = 0
    for i in range(1, n + 1):
        ret += sum([int(c) for c in str(i)])
    return ret

ans_10 = [0]
for i in range(1, 202):
    ans_10.append(45 * 10 ** (i - 1) + ans_10[-1] * 10)


def solve(n):
    s = str(n)
    sz = len(s)
    ans = 0
    so_far = 0
    for i in range(sz):
        cur = int(s[i])
        for j in range(cur):
            ans += (so_far + j) * 10 ** (sz - i - 1) + ans_10[sz - i - 1]
        so_far += cur
    return ans + so_far

def f(L, R):
    return solve(R) - solve(L - 1)

    
a = input()


for i in range(1500):
    t = randint(10 ** 6, 10 ** 18)

    val = solve(t) % a

    L = 2
    R = t
    while R - L > 1:
        M = (L + R) // 2
        if solve(t + M) % a > val:
            R = M
        else:
            L = M

    if f(t + 1, t + L) % a == 0:
        print t + 1, t + L
        break
