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 f(x,y):
    c=0
    d=0
    for i in range(2,y):
        if y%i==0:
            c=1    
            break
        else:
            continue
    for i in range(2,x):
        if x%i==0:
            d=1
            break
        else:
            continue
    if c==1 and d==1:
        s=str(y)+" "+str(x)
        return s
    else:
        return (f(x+1,y+1))

print(f(4,4+n))