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:
n = int(input())
num = 2
num1 = num + n
while(True):
    c1, c2 = 0, 0
    num1 = num + n
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            c1 = 1
            break
    for i in range(2, int(num1 ** 0.5) + 1):
        if num1 % i == 0:
            c2 = 1
            break
##    print(num, c1, num1, c2)
    if c1 == 1 and c2 == 1:
        break
    num += 1
print(num1, num)