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())
t1=1024
c0=0
c1=0
while True:
    t=t1
    t2=t+n
    for x in range(2,int(t**0.5)+1):
        if t%x==0:
            c1=1
            break
    for x in range(2,int(t2**0.5)+1):
        if t2%x==0:
            c0=1
            break
    if c1==1 and c0==1:
        print(str(t2)+" "+str(t))
        break
    c0=0
    c1=0
    t1=t1+2