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_prime(x):
    a=2
    while a*a <= x:
        if x%a == 0:
            return False
        a+=1
    return True

def calc(n):
    for a in range(2,10**9):
        if not is_prime(a) and not is_prime(a+n):
            return map(str,[a+n,a])
    return None
if __name__ == "__main__":
    n = int(input())
    print(" ".join(calc(n)))