#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  int n;
  cin >> n;
  int a = n + n, b = n;
  while (isPrime(a) || isPrime(b)) {
    b = b + n;
    a = a + n;
  }
  cout << a << " " << b << "\n";
  return 0;
}
