#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool prime(int x){
    for(int i = 2; i*i <= x; i++){
        if(!(x%i))return false;
    }
    return true;
}
int main(){
    int n;cin>>n;
    if(n == 1){
        cout << 1 << endl;
        return 0;
    }
    vector<long long> p(10);
    int nw = 0;
    for(long long i = 100001; nw != 10;i+=2){
        if(prime(i)){
            p[nw] = i;
            nw++;
        }
    }
    vector<long long> k;
    for(int i = 0; 10 > i; i++){
        for(int j = i; 10 > j; j++){
            k.push_back(p[i]*p[j]);
        }
    }
    sort(k.begin(),k.end());
    cout << k[n-2] << endl;
}