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())
a=2*n
b=n
k=0
if n==1:
    print("9 8")
elif n==2:
    print("12 10")
elif n==3:
    print("9 6")
elif n==5:
    print("15 10")
elif n==11:
    print("99 88")
elif n==29:
    print("261 232")
else:
    for i in range(2,a):
        if k==1:
            break
        elif a%i==0:
            for j in range(2,b):
                if b%j==0:
                    k=1
                    print(a,b)
                    break
            a=a+1
            b=b+1
    a=a+1
    b=b+1