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 -*-
"""
Created on Sun Dec 22 23:06:41 2019

@author: PC
"""

from math import sqrt


def isPrime(n):
    
    d = 2
    
    while d <= sqrt(n):
        
        if n%d == 0:
            return False
        d += 1
        
    return True

def equation(n):
    
    sol = []
    for i in range(n+2, 10**9+1):
        if not(isPrime(i)) and not(isPrime(n+i)):
            
            sol.append(n+i)
            sol.append(i)
            break
    
    for x in sol:
        print(x, end = " ")
        
      
n = int(input())
equation(n)