// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

const int MAXP = 110000;
bool is_prime[MAXP + 5];
int main() {
    fill(is_prime + 2, is_prime + MAXP + 1, true);
    vector<int> ans(1, 1);
    for(int i=2; i<MAXP; i++) {
        if(!is_prime[i]) continue;
        if(i > 100000) ans.emplace_back(i);
        for(int k=i<<1; k<MAXP; k+=i) is_prime[k] = false;
    }

    int N; cin >> N;
    cout << ans[N-1] << endl;
    return 0;
}