#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
vector<int> primes;
vector<int> primel;
void sieve_of_eratosthenes(int n) {
	primes.resize(n);
	for (int i = 2; i < n; ++i)
		primes[i] = i;
	for (int i = 2; i*i < n; ++i)
		if (primes[i])
			for (int j = i*i; j < n; j += i)
				primes[j] = 0;
	for (int i = 2; i < primes.size(); i++) {
		if (primes[i] == i)primel.push_back(i);
	}
}

int cnt(int a) {
	int res = 0;
	int A = a;
	for (int jj = 0; jj < primel.size(); jj++) {
		int j = primel[jj];
		if (j > a)break;
		if (j*j > a)j = a;
		if (a%j == 0) {
			res++;
			if (res > 2)return 0;
			a /= j;
			if (a%j == 0) {
				if (j*j*j == A) {
					return 1;
				}
				return 0;
			}
			if (primes[a] == a)return 1;
			return 0;
		}
	}
	return 0;

}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	sieve_of_eratosthenes(5000000);
	//cerr << primel.back() << endl;
	int res = 0;
	int i = 0;
	while(res < N){
		res += cnt(i);
		i++;
	}
	/*for (int i = 0; i <= N; i++) {
		res += cnt(i);
	}*/
	cout << i - 1 << endl;
}