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 random

def g(x):
    return x * (x + 1) // 2

def smart(x):
    #g(9) * 10 * (x / 100) + (if u2 cif > 0) g(u2 cif - 1) * 10 + (u2cif) * ((x % 10) + 1)  

    nr = x
    sol = 0
    p10 = 1
    while nr > 0:
        cif = nr % 10
        
        sol += g(9) * p10 * (x // (p10 * 10))
        if cif > 0: 
            sol += g(cif - 1) * p10
            sol += cif * ((x % p10) + 1)
        nr //= 10
        p10 *= 10
    return sol
    

def fnd(limit):
    l, r = 0, limit
    sol = -1
    while l <= r:
        mid = (l + r) // 2
        if smart(mid) <= limit:
            sol = mid
            l = mid + 1
        else:
            r = mid - 1
    assert sol != -1
    return sol

a = int(input())
cur = a
while True:
    x = fnd(cur)
    if smart(x) == cur:
        print(1, x)
        exit(0)
    cur += a