#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;

bool isPrime(ll num){
    if(num<2)           return false;
    else if(num==2)     return true;
    else if(num%2==0)   return false;
    for(ll i=3;i*i<=num;i+=2) if(num%i==0) return false;
    return true;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    vector<ll> v;
    for(ll i=m+1;v.size()<=10;i+=2){
        if(isPrime(i)) v.push_back(i);
    }

    vector<ll> ans;
    rep(i,v.size()){
        for(int j=i;j<v.size();j++){
            ans.push_back(v[i]*v[j]);
        }
    }
    ans.push_back(1);
    sort(ALL(ans));
    // debug(ans);
    int n;cin>>n;n--;
    cout<<ans[n]<<endl;
    return 0;
}