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())
import math
def composite(a):
    c=0
    for i in range(2,int(math.pow(a,0.5))+1):
        if (a%i)==0:
            c=1
            break
    if c==1:
        return "yes"
    else:
        return "no"
i=1
d=1
while d>0:
    if composite(i)=="yes" and composite(i+n)=="yes":
        d=0
    i+=1
l=[str(i+n-1),str(i-1)]
print(" ".join(l))