#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

ll m=100000;
vector<ll> ans;

void fill(){
    ans.push_back(1);
    for(ll i=m+1;ans.size()<=10;i++){
        bool f=true;
        for(ll j=2;j<=m;j++){
            if(i%j==0){
                f=false;
                break;
            }
        }
        if(f) ans.push_back(i);
    }
}

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

    // fill();
    ll res[]={1, 100003, 100019, 100043, 100049, 100057, 100069, 100103 ,100109,100129,100151};
    int n;cin>>n;
    cout<<res[n-1]<<endl;
    return 0;
}