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())
if n==1:
    print(15,14)
elif n==2:
    print(14,12)
elif n==3:
    print(15,12)
elif n==4:
    print(16,12)
elif n==5:
    print(15,10)
elif n==6:
    print(26,20)
elif n==7:
    print(27,20)
elif n==8:
    print(28,20)
elif n==9:
    print(27,18)
elif n==10:
    print(30,20)
elif n==11:
    print(33,22)
elif n%2==0:
    print(n+4,4)
else:
    print(n+9,9)