#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>

int main()
{
    bool debug = false;

    // input
    int N;
    scanf( "%d", &N );

    // process
    long elements[] = { 100003, 100019, 100043, 100049, 100057, 100069, 100103, 100109, 100129, 100151 };
    std::vector<long> candidates;
    candidates.push_back(1);
    for ( int i=0; i<7; i++ ) {
        for ( int j=i; j<7; j++ ) {
            candidates.push_back( elements[i] * elements[j] );
        }
    }
    std::sort( candidates.begin(), candidates.end() );

    // output
    if ( debug ) {
        for ( int i=0; i<candidates.size(); i++ ) {
            std::cout << i << " th: " << candidates[i] << std::endl;
        }
    }

    printf( "%ld\n", candidates[N-1] );

    return 0;
}