#include <iostream>
#include <fstream>
#define MAX 100000
using namespace std;

int eratostene[MAX];

long long solve_prime(long long n){
    long long index_prime = 0;
    long long last_prime = 2;
    long long i = 2;

    while (1){
        if (index_prime == n + 1){
            break;
        }

        if (eratostene[i] == 0){
            last_prime = i;
            index_prime++;

            for (long long j = i * i; j < MAX; j = j + i){
                eratostene[j] = 1;
            }
        }
        i++;
    }
    return last_prime;
}

int main(void){

    ifstream in;
    ofstream out;

    in.open("prim.in");
    out.open("prim.out");

    long long n;
    long long result;
    in >> n;
    result = solve_prime(n) * solve_prime(n);
    out << result;
    in.close();
    out.close();
    return 0;
}