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())

l = {1:0, 2:0}

def is_composite(x):
    if x in l:
        return l[x]
    for j in range(2, int(x ** 0.5 + 1)):
        if x % j == 0:
            l[x] = 1
            return True
    l[x] = 0
    return False

ans_a = ans_b = 0
for i in range(20000001):
    j = i+n
    if is_composite(i) and is_composite(j):
        ans_a = j
        ans_b = i
        break

print(ans_a, ans_b)