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())
def isComposite(n):
    b=[n,4][n<=4]
    a=b+n
    flag1=flag2=0
    while True:
        
        while True:
            for i in range(2,b//2+1):
                if b%i==0:
                    flag1=1
                    break
            if flag1==1:
                break
            b+=1
        a=b+n
        flag2=0
        while True:
            for i in range(2,a//2+1):
                if a%i==0:
                    flag2=1
                    break
            if flag2==1:
                break
            a+=1

        if a-b==n:break
        b=a-n
        flag1=0
    print(a,b)

isComposite(n)