Problem: Let's call a positive integer composite if it has at least one divisor other than 1 and itself. For example:

  * the following numbers are composite: 1024, 4, 6, 9; 
  * the following numbers are not composite: 13, 1, 2, 3, 37. 



You are given a positive integer n. Find two composite integers a,b such that a-b=n.

It can be proven that solution always exists.

Input

The input contains one integer n (1 ≤ n ≤ 10^7): the given integer.

Output

Print two composite integers a,b (2 ≤ a, b ≤ 10^9, a-b=n).

It can be proven, that solution always exists.

If there are several possible solutions, you can print any. 

Examples

Input


1


Output


9 8


Input


512


Output


4608 4096

Solution (in PYTHON3):

Solution:
# cook your dish here
# cook your dish here
n= int(input())
let_a = 4 
let_b = 0 
flag = 0

def check (num1  ):
    r1 = num1-1 
    r2 = num1 + 1
    if(r1%6==0 or r2%6==0):
        return False 
    return True
    

while True :
    let_a = let_a 
    let_b = let_a + n 
    result = check(let_a) and check(let_b)
    if(result):
        break
    let_a += 1

print(let_b,let_a)