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:
#list(map(int,input().split()))
#map(int,input().split())
#for _ in range(int(input()))
def check(b):
	ct=0
	for i in range(1,b+1):
		if b%i==0:
			ct+=1
		if ct>2:
			return True
	return False
def find(n):
	a,b=4,4
	while True:
		while check(a)==False:
			a+=1
		b=a+n
		if check(b):
			return a,b
		a+=1

n=int(input())
ans=find(n)
print(ans[1],ans[0])