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:
# code by RAJ BHAVSAR
def iscom(num):
	i = 2
	while(i*i <= num):
		if(num%i == 0):
			return True
		i += 1
	return False

n = int(input())
if(n%2 == 0):
	print(4+n,4)
else:
	t1,t2,t3 = 4+n,6+n,8+n
	if(iscom(t1)):
		print(t1,4)
	elif(iscom(t2)):
		print(t2,6)
	else:
		print(t3,8)