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:
# -*- coding: utf-8 -*-
"""#609 v2 A

Automatically generated by Colaboratory.

Original file is located at
    https://colab.research.google.com/drive/1neA2VZ7iRTJiFOeslxdBvICicJqpNRHH
"""

n=int(input())
if n!=2 and n%2==0:
  print(n*2,n)
elif n==2:
  print(6,4)
elif n%2!=0 and n!=1:
  print(n*3,n*2)
elif n==1:
  print(9,8)