#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
const int MAX=5000000;
vector<ll> prime;
bool isprime[MAX];
void sieve(){
	for(ll i=3; i<MAX; i+=2){
		isprime[i]=1;
	}
	isprime[2]=1;
	prime.push_back(2);
	for(ll i=3; i<MAX; i++){
		if(isprime[i]){
			prime.push_back(i);
			for(ll j=2*i; j<MAX; j+=i){
				isprime[j]=0;
			}
		}
	}
	return;
}
int main()
{
    sieve();
    vector<ll> ans;
    for(int i=0; i<prime.size(); i++){
        ll p=prime[i];
        for(int j=i+1; (j<prime.size() && prime[j]*p<=1e7); j++){
            ll q=prime[j];
            ans.push_back(p*q);
        }
    }
    for(int i=0; i<prime.size(); i++){
        ll p=prime[i];
        ll x=p*p*p;
        if(x>1e7) break;
        ans.push_back(x);
    }
    sort(ans.begin(), ans.end());
    int n; cin>>n;
    cout<<ans[n-1]<<endl;
    return 0;
}