#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef  long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define  MP make_pair
#define  PB push_back
#define inf  1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
#define N 2000000
vector<ll> prime;
long long  mod = 1000000007;
bool arr[N];
void Eratosthenes(){
	for(int i = 0; i < N; i++){
		arr[i] = 1;
	}
	for(int i = 2; i < N; i++){
		if(arr[i]){
            prime.push_back((ll)i);
			for(int j = 0; i * (j + 2) < N; j++){
				arr[i *(j + 2)] = 0;
			}
		}
	}

}
int main(){
    Eratosthenes();
    int n;
    cin >> n;
    vector<ll>v;
    //cout << prime[prime.size()-1] << endl;
    ll s = 2* prime[prime.size()-1];
    for(int i=0;i<prime.size();i++){
        if(i==0){
            for(int j=1;j<prime.size();j++){
                v.PB(prime[0]*prime[j]);
            }
            
        }else{
            for(int j=i+1;j<prime.size();j++){
                if(prime[i]*prime[j]>s)break;
                v.PB(prime[i]*prime[j]);
            }
        }
    }
    for(int i=0;i<prime.size();i++){
        if(prime[i]*prime[i]*prime[i]>s)break;
        v.PB(prime[i]*prime[i]*prime[i]);
    }
    sort(v.begin(),v.end());
    cout << v[n-1] << endl;
    return 0;
}