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:
import math
import sys
def prime(num):
    check=False
    for k in range(2,int(math.sqrt(num))+1):
        if(num%k==0):
            check=True
            break
    return check
n=int(input())
if(n%2==0):
    print(str(4+n)+' '+'4')
else:
    for i in range(4,1000000000):
        if(prime(i) and prime(i+n)):
            print(str(i+n)+' '+str(i))
            sys.exit()