#include <bits/stdc++.h>
using namespace std;
void init() {}
int binarySearch(long int arr[], int l, int r, long int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return l;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int qwe;
  qwe = 1;
  init();
  while (qwe--) {
    long int n;
    cin >> n;
    if (n == 1)
      cout << 9 << " " << 8;
    else
      cout << n + n + n << " " << n + n;
  }
  return 0;
}
