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
import math

def prefix_digit_sum(x):
    if x < 10: return x*(x+1)//2
    k = math.floor(math.log10(x))
    b = x//(10**k)
    suffix = x%(10**k)
    return b*45*k*10**(k-1) + (b*(b-1)*10**k)//2 + b*(suffix+1) + prefix_digit_sum(suffix)

def sum_of_sums(l,r):
    return prefix_digit_sum(r) - prefix_digit_sum(l-1)

a = int(input())
if a < 10:
    l, r = int('1'*a), int('1'*a)
    print(l, r)
    
else:
    k = math.floor(math.log10(a))+1
    suffix = (-45 * k * 10**(k-1) - 1 - 10**k) % a
    l, r = 10**k + suffix + 1, 2*10**k + suffix
    print(l, r)

