#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase

const llint mod=1000000007;
const llint big=1e17+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
int LBI(vector<int>&ar,int in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
int UBI(vector<int>&ar,int in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int main(void){
	int i,j,n;cin>>n;
	int cou=0;
	i=1;cou=0;
	if(100000<n){i=460012;cou=100000;}
	if(200001<n){i=951149;cou=200001;}
	if(300000<n){i=1453461;cou=300000;}
	if(400000<n){i=1963803;cou=400000;}
	if(500000<n){i=2478458;cou=500000;}
	if(600000<n){i=2998826;cou=600000;}
	if(700000<n){i=3522423;cou=700000;}
	if(800000<n){i=4049527;cou=800000;}
	if(900000<n){i=4578533;cou=900000;}
	for(;i<mod;i++){
		int yaku=0;
		for(j=1;j*j<i;j++){
			if(i%j==0){yaku+=2;}
			if(yaku>4){break;}
		}
		if(j*j==i){yaku++;}
		if(yaku==4){cou++;}
		if(cou==n){cout<<i<<endl;return 0;}
	}
}