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:
def isPrime(n):
    if n < 4 or n == 5 or n == 7: return True
    if n%2 == 0 or n%3 == 0 or n%5 == 0 or n%7 == 0: return False
    for i in range(9, int(n ** 0.5)+1, 2):
        if n%i == 0:
            return False
    return True

n = int(input())
a = 4
b = 0
while True:
    b = n + a
    if isPrime(a) or isPrime(b):
        a += 1
    else:
        break
print('{} {}'.format(max(a, b), min(a, b)))