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:
def isprime(n):
	if(n==1):
		return False

	i=2
	while(i*i<=n):
		if(n%i==0):
			return False
		i+=1
	return True

n=int(input())

if(isprime(n)):
	num=n+2
	steps=2
	while(True):
		b1=not(isprime(num))
		b2=not(isprime(steps))
		if(b1 and b2):
			break
		num+=1
		steps+=1

	print(num,steps)

else:
	if(n==1):
		print(9,8)
	else:
		print(2*n,n)