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
#!/usr/bin/env python
#-*- coding:utf-8 -*-

import math

a = int(raw_input())
r = int(math.ceil(math.log(a, 10))) + 1
z = (45 * r * pow(10, r - 1, a) + 1) % a
x = a - z
print x + 1, 10 ** r + x
# print fsum(10**5 + 100) - fsum(100) - fsum(10**5)
# print fsum(11010), fsum(10000) + 1010 + fsum(1000) + 10 + fsum(10)
