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 pdb
import math as mm
def solve(n):
	# 1
	a = 0
	b = 0
	b2 = False
	b1 = False
	calc = 0
	for i in range(1,10):
		b2 = False
		b1 = False
		a = n * i
		b = n * (i+1)
		#print(a,b)
		for j in range(2,a):
			if (a%j == 0):
				b2 = True
				break
		for k in range(2,b):
			if (b%k == 0):
				b1 = True
				break
		#print(b,b1)
		if b2 and b1:
			calc = int(mm.fabs(a - b))
		if (calc == n):
			return b,a	
#__main__
user = int(input())
x,y = solve(user)
print(x,y)