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:
n=int(input())
for i in range(2,10000000000):
    a=n+i
    b=i
    if a!=2 and a!=3 and a!=5 and a!=7:
        if b!=2 and b!=3 and b!=5 and b!=7:
            if a%2==0 or a%3==0 or a%5==0 or a%7==0:
                if b%2==0 or b%3==0 or b%5==0 or a%7==0:
                    print(a,b)
                    break