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
a = int(raw_input())

def s(n):
    r = 0
    while n > 0:
        r += n % 10
        n /= 10
    return r

def s1(n):
    if n < 10:
        return sum(range(0, n + 1))
    D = n % 10
    r = 0
    for d in range(10):
        if d <= D:
            r += d*(n / 10 + 1)
        else:
            r += d*(n / 10)
    r += s(n / 10) * (D + 1)
    r += s1((n / 10) - 1) * 10
    return r

def s2(n):
    r = 0
    for i in range(n + 1):
        r += s(i)
    return r


was = {}
was[0] = 0

x = 0
while True:
    x += a
    l = 0
    r = max(a, 100)
    while l + 1 < r:
        m = (l + r) / 2
        if s1(m) < x:
            l = m
        else:
            r = m
    k = s1(r) % a
    assert k < 2000
    if k in was:
        print was[k] + 1, r
        break

    was[k] = r



