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:
a, bn, count = 0, 3, 4
number = int(input())
prime = []
for num in range(1000):
    if num > 1:
        for i in range(2, num):
            if (num % i) == 0:
                break
            else:
                prime.append(num)
while a == 0:
    count += 1
    for o in prime:
        if o >= count:
            break
        else:
            if count % o == 0:
                bn = count + number
                for m in prime:
                    if m >= bn:
                        break
                    else:
                        if bn % m == 0:
                            a = 1
                            break
print(bn, count)