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:
import math
from collections import defaultdict
ml=lambda:map(float,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())

"""========main code==============="""

t=ii()
a=4
b=a+t
f=1
while(f):
    f=1
    s1=set()
    s2=set()
    for i in range(2,int(math.sqrt(a))+1):
        if(a%i==0):
            s1.add(i)
            if(a//i!=i):
                s1.add(a//i)
    for i in range(2,int(math.sqrt(b))+1):
        if(b%i==0):
            s2.add(i)
            if(b//i!=i):
                s2.add(b//i)
    if(len(s1)>0 and len(s2)>0):
        f=0
        break
    a+=1
    b+=1
#for _ in range(t):
print(b,a)