#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;

using ll = long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = 1e9;
const long long INFL = 1LL<<60;

vector<bool> create_eratos(int n)
{
  vector<bool> isprime(n+1, 1);
  isprime[0] = 0;
  isprime[1] = 0;

  for (int i = 2; i * i <= n; i++) {
    if (isprime[i]) {
      int j = i + i;
      while (j <= n) {
        isprime[j] = 0;
        j = j + i;
      }
    }
  }
  return isprime;
}

vector<int> createPrimeList(int n)
{
  vector<bool> eratos = create_eratos(n);
  vector<int> result;
  result.reserve(n);
  for (int i = 1; i <=n; i++) {
    if (eratos[i]) {
      result.push_back(i);
    }
  }
  return result;
}

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

  int n;
  cin >> n;

  auto primes = createPrimeList(1e+6);

  vector<ll> ans;
  ans.push_back(1);
  for (int v : primes) {
    if (v <= 1e5) continue;
    ans.push_back(v * v);
  }

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

  return 0;
}