#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 9, OO = 0x3f3f3f3f, MOD = 1000000007;
const long long OOLL = 0x3f3f3f3f3f3f3f3f;
int n, m, k;
bool prime(int x) {
  for (int i = 2; i <= x / i; ++i) {
    if (x % i == 0) return 0;
  }
  return 1;
}
int main() {
  scanf("%d", &n);
  int a = 1e9;
  int b = a - n;
  if (prime(b)) --a, --b;
  printf("%d %d\n", a, b);
  return 0;
}
