#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i, n) for (int i = 0; i < int(n); i++) using namespace std; long long MOD = 1000000007; long long INF = 1000000000000000000; //10^18 typedef long long ll; typedef unsigned long long ull; ll powMod(ll x, ll n, ll mod) { if (n == 0) return 1; ll t = powMod(x, n/2, mod); t = t * t % mod; if (n & 1) return t * x % mod; return t; } ll gcd(ll a, ll b) { if (a == 0 || b == 0) return a + b; if (b > a) return gcd(b, a); return gcd(b, a % b); } int main(void) { int n; cin >> n; if (n == 1) { cout << 1 << endl; return 0; } ll p[] = {100003,100019,100043,100049,100057,100069}; vector a; rep(i, 6) rep(j, 6) a.push_back(p[i]*p[j]); sort(a.begin(), a.end()); cout << a[n-2] << endl; }