using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Globalization;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var prime = Enumerable.Repeat(true, 100_100).ToArray();
        for (var i = 2; i < prime.Length; ++i) for (var j = i * 2; j < prime.Length; j += i) prime[j] = false;
        var plist = new List<long>();
        for (var i = 100_001; i < prime.Length; ++i) if (prime[i]) plist.Add(i);
        var ans = new List<long>();
        ans.Add(1);
        for (var i = 0; i < plist.Count; ++i) for (var j = i; j < plist.Count; ++j) ans.Add(plist[i] * plist[j]);
        ans.Sort();
        WriteLine(ans[n - 1]);
    }
}