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):
    if(n==1 or n==0 or n==2 or n==3): 
        return True
    if(n==4):
        return False
    s = int(n**(1/2)) 
    for i in range(2,s+2):
        if(n%i == 0):
            #print(n,i)
            return False 
    return True 

n = int(input())
#print(isPrime(5)) 
for i in range(1,1000000):
    if(not(isPrime(i)) and not(isPrime(i+n))):
        print(i+n,i)
        break