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
#include <bits/stdc++.h>
using namespace std;
int main() {
  int x;
  cin >> x;
  int m = 0;
  int z = x;
  x += 4;
  for (int i = 2; i < x; i++) {
    if (x % i != 0) {
      m = 1;
    } else {
      cout << x << " "
           << "4";
      m = 0;
      break;
    }
  }
  if (m == 1) {
    x = z;
    x += 6;
    for (int i = 2; i < x; i++) {
      if (x % i != 0) {
        m = 2;
      } else {
        cout << x << " "
             << "6";
        m = 3;
        break;
      }
    }
  }
  if (m == 2) {
    x = z;
    x += 8;
    for (int i = 2; i < x; i++) {
      if (x % i != 0) {
        m = 4;
      } else {
        cout << x << " "
             << "8";
        m = 5;
        break;
      }
    }
  }
  if (m == 4) {
    x = z;
    x += 9;
    for (int i = 2; i < x; i++) {
      if (x % i != 0) {
        m = 6;
      } else {
        cout << x << " "
             << "9";
        m = 7;
        break;
      }
    }
  }
}
