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:
diff = int(input())
def check(num):
    flag = 0
    i=2
    while i<num:
        if num % i == 0:
            flag=1
            break
        i = i + 1
    return flag
i=4
while i>=4:
    if check(i)==0 or check(i+diff)==0:
    	i = i + 1
    	continue
    if check(i)==1 and check(i+diff)==1:
        print(i+diff,end=' ')
        print(i)
        break