#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}







int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        int n;
        cin >> n;
        if (n == 1) {
            cout << 1; return 0;
        }
        vector<ll>p;
        for (ll i = 1e5 + 1;; i += 2) {
            bool f = 0;
            for (ll j = 3; j * j <= i; j++) {
                if (i % j)continue;
                f = 1;
                break;
            }
            if (!f)p.push_back(i);
            if (p.size() >= 10)break;
        }
        vector<ll>r;
        map<ll, bool>f;
        for (int i = 0; i < p.size(); i++) {
            //cout << p[i] << endl;
            for (int j = 0; j < p.size(); j++) {
                if (!f[p[i] * p[j]]) {
                    r.push_back(p[i] * p[j]);
                    f[p[i] * p[j]] = 1;
                }
            }
        }
        r.push_back(1);
        sort(r.begin(), r.end());
        cout << r[n];
    }
    return 0;
}