#include<fstream>
using namespace std;
long n,k,b=0,a[100001],v[100001],i,j,c[100001],p;
int nr=0;
int prim(int x)
{int i,g=1;
for(i=2;i<=x/2;i++)
	if(x%i==0) {g=0; i=x;}
	return g;}
int main()

{ifstream f("prim.in");
ofstream g("prim.out");
f>>k; int d=9;
if(k==1) g<<d;
else
{while(nr<k)
{for(i=2;i<=k*k;i++)
	if(a[i]==0)
	{{nr++;
	v[nr]=i;}
	for(j=i*i;j<=k*k;j=j+i)
	{a[j]=a[j]+1;
	if(a[j]==1)
	{b++;
	c[b]=j;}}}}
for(i=1;i<=b;i++)
	{int ok=0;
		for(j=1;j<=k;j++)
			if(c[i]%v[j]!=0) ok++;
		else j=k+1;
			if(ok==k)
			{g<<c[i]; i=b+1; ok=4;}
	if(ok<4)
	for(i=c[b];i<=10000;i++)
	{ok=0;
	for(j=1;j<=k;j++)
			if(i%v[j]!=0&&!prim(i)) ok++;
		else j=k;
			if(ok==k)
			{g<<i; i=10001; ok=4;}}}
	return 0;}}