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())
a=n
b=0
comp1=0
comp2=0
temp1=2
temp2=2
while True:
  comp1=0
  comp2=0
  temp1=2
  temp2=2
  while temp1<=a**0.5:
    if a//temp1==a/temp1 and a!=temp1:
      comp1=1
      break
    else:
      temp1+=1
  if not comp1:
    a+=1
    b+=1
    continue
  else:
    while temp2<=b**0.5:
      if b//temp2==b/temp2 and b!=temp2:
        comp2=1
        break
      else:
        temp2+=1
  if comp1 and comp2:
    print(a,b,end=" ")
    break
  else:
    a+=1
    b+=1