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())
if n%2==0:
    b=int(4)
    a=n+4
    print(a,b)
else:
    def comp(x):
        for i in range(2,int(x/2)):
            if(x%i==0):
                return 1
                break
        return 0    
    b=int(4)
    while (1):
        a=b+n
        cp=comp(a)
        if(cp==1):
            print(a,b)
            break
        b+=1    
        while(1):
            if(comp(b)==0):
                b+=1
            else:
                break