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 isprime(x):
    for i in range(2,x):
        if (x%i==0):
            return(1)
    return(0)

n=int(input())
i=1
k='y'
while(k=='y'):
    a=n*i
    b=n*(i+1)
    x=isprime(a)
    y=isprime(b)
    if (x==1) and (y==1):
        print(b,a,sep=' ')
        k='n'
    if (y==0):
        i=i+2
    else:
        i=i+1