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:
import math


def is_prime(n):
    if n<=1:
        return False
    elif n<4:
        return True
    elif n%2==0:
        return False
    elif n%3==0:
        return False
    elif n<9:
        return True
    else:
        r=math.floor(math.sqrt(n))
        f=5
        while f<=r:
            if n%f==0:
                return False
            if n%(f+2)==0:
                return False
            f=f+6
        return True

n=int(input())
start=n-(n//2)
end=start+n
while True:
    if is_prime(start)==False and is_prime(end)==False:
        print(end,start)
        break
    else:
        start+=1
        end+=1