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 compo(num):
        r=2
        s=0
        while r<num:
            if num%r==0:
                s=s+1
                if s>0:
                    return(True)
                    break
                else:
                    return(False)
            r=r+1


n=int(input())
r=4
while True:
    if compo(r)==True:
        b=r
        a=n+b
        if compo(a)==True:
            break
    r=r+1
print(a,b)