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 % 3 == 0):
    print(6 + n, 6)
elif (n % 3 == 1):
    print(8 + n, 8)
else:
    print(4 + n, 4)





# n,k,t = map(float, input().split())
# x = [0 for i in range(int(n))]
# y = [0 for i in range(int(n))]
# c = [0 for i in range(int(n))]
# dist = []
# for i in range(int(n)):
#     a, b, cl = map(float, input().split())
#     x[i] = a
#     y[i] = b
#     c[i] = int(cl)
# for i in range(int(t)):
#     dist = []
#     clst = [0 for j in range(11)]
#     mx = 0
#     ans = 0
#     a, b = map(float, input().split())
#     for j in range(int(n)):
#         dist.append([((x[j] - a) ** 2 + (y[j] - b) ** 2) ** (1/2), c[j]])
#     dist = sorted(dist, key=lambda tup: tup[0])
#     for j in range(int(k)):
#         clst[dist[j][1]] += 1
#     for j in range(1, len(clst)):
#         if clst[j] > mx:
#             mx = clst[j]
#             ans = j
#     print(ans)
#
#
#
# print(8000**5)

# s = input()
# k = 0
# for i in range(len(s) // 2):
#     if s[i] != s[-i-1]:
#         k = k + 1
# if k == 0:
#     print(0)
# else:
#     print(k-1)

#
# def check_one(s):
#     for j in range((len(s) + 1) // 2, len(s)):
#         if s[0:j] == s[len(s) - j:len(s)+1]:
#             return 1
#     return 0
#
#
# st = input()
# k = 0
# for i in range(2, len(st) + 1):
#     k += check_one(st[0:i])
# print(k)