#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }

bool is_prime(ll num) {
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;

  double sqrt_num = sqrt(num);
  for (ll i = 3; i <= sqrt_num; i += 2) {
    if (num % i == 0)
      return false;
  }

  return true;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> primes;
  rep(i, 1, 100001) {
    if (is_prime(i))
      primes.push_back(i);
  }

  vector<ll> ans(10), v;
  ans[0] = 1;
  rep(i, 100001, 101001) {
    if (is_prime(i))
      v.push_back(i);
    if (v.size() == 9)
      break;
  }

  rep(i, 0, 9) { ans[i + 1] = v[i] * v[0]; }

  cout << ans[n - 1] << endl;
}