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:
n=int(input())
b=4
a=b+n
aa=1
while aa!=2:
  qa,qb=0,0
  for i in range(2,a):
    if a%i==0:
      qa=1
      break
  for i in range(2,b):
    if b%i==0:
      qb=1
      break
  aa=qa+qb
  if aa==2: break
  else:
    a+=1
    b+=1
print(a,b)