#include
using namespace std;
void optimisedPrimes(long long integer p,long long integer n,long long integer key)
{
for(long long integer i=2;i<=n;i++)
{
p[i]=1;
}
for(long long integer i=4;i<=n;i+=2)
{
p[i]=0;
}
for(long long integer i=3;i<=n;i+=2)
{
if(p[i])
{
for(long long integer j=ii;j<=n;j+=i)
{
p[j]=0;
}
}
}
p[0]=0;
p[1]=0;
long long integer count=0;
for(long long integer i=0;i<=n;i++)
{
if(p[i])
{
count++;
if(count==key)
{
cout<<i;
}
}
}
}
int main()
{
long long integer p[5000000]={0};
long long integer key;
cin>>key;
optimisedPrimes(p,500000,key);
return 0;
}