#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 10000
vector<bool>sieve(N,true);
vector<ll>prime_no;
void prime_sieve(){
sieve[0]=sieve[1]=false;
for(auto i=2;i<=N;i++){
if(sieve[i]){
prime_no.push_back(i);
for(auto j=i*i;j<=N;j+=i){
sieve[j]=false;
}
}
}
}
int main() {
prime_sieve();
ll n;
cin>>n;
cout<<prime_no[n-1];
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBsb25nIGxvbmcgbGw7CiNkZWZpbmUgTiAxMDAwMAp2ZWN0b3I8Ym9vbD5zaWV2ZShOLHRydWUpOwp2ZWN0b3I8bGw+cHJpbWVfbm87Cgp2b2lkIHByaW1lX3NpZXZlKCl7CgkKCXNpZXZlWzBdPXNpZXZlWzFdPWZhbHNlOwoKCWZvcihhdXRvIGk9MjtpPD1OO2krKyl7CgkJaWYoc2lldmVbaV0pewoJCXByaW1lX25vLnB1c2hfYmFjayhpKTsKCQlmb3IoYXV0byBqPWkqaTtqPD1OO2orPWkpewoJCXNpZXZlW2pdPWZhbHNlOwoJCX0KCQl9Cgl9Cn0KaW50IG1haW4oKSB7CglwcmltZV9zaWV2ZSgpOwoJbGwgbjsKCWNpbj4+bjsKCWNvdXQ8PHByaW1lX25vW24tMV07CglyZXR1cm4gMDsKfQ==