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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long INFLL = 2e18;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 10;
const double EPS = 1E-9;
const double EPS_ANG = 1E-16;
const static double PI = 3.141592653589793;
bool isPrime(long long n) {
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int main(int argc, char** argv) {
  long long n, a, b = 0;
  cin >> n;
  for (a = n;; ++a, ++b) {
    if (isPrime(a)) continue;
    if (isPrime(b)) continue;
    break;
  }
  cout << a << " " << b << endl;
  return 0;
}