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:

#Q3
# for _ in range(int(input())):
# 	n = int(input())
# 	s = input()
# 	k = 1
# 	maxx = 0
# 	b = True
# 	while k<n:
# 		# print(k)
# 		for i in range(n-k+1):
# 			a = s[i:i+k]
# 			# print('a= ', a)
# 			for j in range(i+1,n-k+1):
# 				b = s[j:j+k]
# 				# print('b= ',b )
# 				if a==b:
# 					maxx = max(k,maxx)
# 		k+=1
# 	print(maxx)

# def fun1(a,ai,aj,b,bi,bj):
# 	if a[ai:aj]==b[bi:bj]:
# 		if ai!=bi:
# 			return len(a[ai:aj])
# 		else:
# 			return 0
# 	else:
# 		return fun1(a,ai+1,aj,b,bi+1,bj)
# def fun2(a,ai,aj,b,bi,bj):
# 	if a[ai:aj]==b[bi:bj]:
# 		if ai!=bi:
# 			return len(a[ai:aj])
# 		else:
# 			return 0
# 	else:
# 		return fun2(a,ai,aj-1,b,bi,bj-1)
# def fun3(a,ai,aj,b,bi,bj):
# 	if a[ai:aj]==b[bi:bj]:
# 		if ai!=bi:
# 			return len(a[ai:aj])
# 		else:
# 			return 0
# 	else:
# 		return fun3(a,ai+1,aj,b,bi,bj-1)
# def fun4(a,ai,aj,b,bi,bj):
# 	if a[ai:aj]==b[bi:bj]:
# 		if ai!=bi:
# 			return len(a[ai:aj])
# 		else:
# 			return 0
# 	else:
# 		return fun4(a,ai,aj-1,b,bi+1,bj)
# for _ in range(int(input())):
# 	n = int(input())
# 	s = input()
# 	a = s
# 	b = s
# 	print(max(fun1(a,0,n-1,b,1,n),fun2(a,0,n-1,b,1,n),fun3(a,0,n-1,b,1,n),fun4(a,0,n-1,b,1,n)))
# for _ in range(int(input())):
# 	a,b = map(int,input().split())
# 	a,b = min(a,b),max(a,b)
# 	v,w = a,b
# 	diff = b-a.
# 	c1 = 0
# 	x = 1
	# a,b = v,w
	# for i in range(1,len(op)):
	# 	x+=1
	# 	if op[i]>diff:
	# 		c1 += i-1
	# 		a+=op[i-1]
	# 		break
	# # print(c1)
	# print(a,b)
	# x-=1
	# print(x)
	# while True:
	# 	# print(a,b)
	# 	if a==b:
	# 		print(c1)
	# 		break
	# 	if b>=(a+x):
	# 		a+=x
	# 		x+=1
	# 		c1+=1
	# 	else:
	# 		b+=x
	# 		x+=1
	# 		c1+=1
	# x = 1
	# c = 0
	# a,b = v,w
	# for i in range(1,10**5+1):
	# 	if i*(i+1)//2>diff:
	# 		x = i-1
	# 		c =i-1
	# 		break
	# a += (x*(x+1)//2)
	# c+= 2*(b-a)
	# print(c)
n = int(input())
print(n*9,n*8)