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
def primenum(x):
	count=0
	if(x==1):
		return False
	else:
		for i in range(2,int(math.floor(math.sqrt(x)))+1):
			if(x%i==0):
				count=count+1
		if(count==0):
			return True
		else:
			return False
n=int(input())
x=2
y=2+n
for i in range(100000):
	if(primenum(x)==False and primenum(y)==False):
		print(y,x)
		break
	else:
		x=x+1
		y=y+1