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:
def isPrime(n):
    prime = [True for i in range(n + 1)]
    i=2
    while i**2<= n:
        if prime[i] == True:
            for j in range(i*2,n+1,i):
                prime[j] = False
        i+=1
    prime[0] = False
    prime[1] = False
    return prime[n]

n=int(input())
b=8
a=b+n
if isPrime(a):
    b+=1
    a+=1
print(a,b)