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 main(n):
    index = n + 1
    while True:
        x = (index - n)
        # print(index, x)
        if x != 2:
            if (x % 2) == 0:
                if index != 2:
                    if (index % 2) == 0:
                        return [index, x]
        composite_x = False
        i = 2
        while i < x:
            if (x % i) == 0:
                composite_x = True
                break
            i = i + 1
        composite_index = False
        i = 2
        while i < index:
            if (index % i) == 0:
                # print(i, index)
                composite_index = True
                break
            i = i + 1
        # print(index, x)
        if composite_index and composite_x:
            return [index, x]
        index = index + 1


if __name__ == '__main__':
    n = int(input())
    res = main(n)
    print(*res)