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
def g (x):
    global arr
    z = 0
    while 10 ** z <= x:
        z += 1
    z -= 1
    ans = 0
    while x > 0:
        y = x // 10 ** z
        ans += 10 ** z * y * (y - 1) // 2
        ans += y * arr[z]
        ans += y * (x % 10 ** z)
        x %= 10 ** z
        z -= 1
    return ans

def f(x):
    r = 0
    while x > 0:
        r += x % 10
        x //= 10
    return r

n = 100
arr = [0] * n
for i in range(1, n):
    arr[i] = 45 * 10 ** (i - 1) + 10 * arr[i - 1]
for i in range(n):
    arr[i] += 1
a = int(input())
ans = [-1] * 1000
for i in range(1, 1000):
    L, R = 1, 10 ** 30
    while R - L > 1:
        M = (L + R) // 2
        if g(M) - f(M) > i * a:
            R = M
        else:
            L = M
    x = g(R) % a
    if ans[x] != -1:
        print(ans[x], R)
        break
    else:
        ans[(g(R) - f(R)) % a] = R
