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 is_composite(num):
#     if( (num % 2) and (num % 3) and (num % 5) and (num % 7) and (num % 11) and (num % 13) and (num % 17)):
#         return True
#     else:
#         return False
def is_prime(n: int) -> bool:
    """Primality test using 6k+-1 optimization."""
    if n <= 3:
        return n > 1
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i ** 2 <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True


def solve(n):
    a = 4
    b = a + n
    while ( is_prime(a) or is_prime(b)):
        a += 1
        b += 1

    print(f'{b} {a}')


# print(str(is_composite(17)))
n = int(input())
solve(n)
# for i in range(1300):
#     solve(i)