#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const int MAX_L = 6000000;
int counter[MAX_L];

int main() {
  int N;
  cin >> N;

  memset(counter, 0, sizeof(counter));
  for (int i = 1; i <= MAX_L; ++i) {
    for (int j = i; j <= MAX_L; j += i) {
      counter[j]++;
    }
  }

  int i = 1;
  int cnt = 0;
  while (cnt < N) {
    i++;
    if (counter[i] == 4) ++cnt;
  }

  cout << i << endl;

  return 0;
}