#include<iostream> 
#include<cstdio> 
#include<algorithm>
using namespace std;
int n;
int prime(int x)
{
	if(x==1)return 0;
 	for(int i=2;i*i<=x;i++)
 	{
 		if(x%i==0)return 0;
	 }
	return 1;
}
void dfs(int z,int w)
{
	if(w==1)
	{
		dfs(2,2);
		dfs(3,2);
		dfs(5,2);
		dfs(7,2);
	}
	else{
		for(int i=1;i<=10;i+=2)
		{
			if(prime(z*10+i)==1)
			{
				if(w==n)printf("%d\n",z*10+i);
				else dfs(z*10+i,w+1);
			}
		}
	}
}
int main()
{
	freopen("sprime.in","r",stdin);
	freopen("sprime.out","w",stdout);
	scanf("%d",&n);
	if(n==1)printf("2\n3\n5\n7\n");
	else
	dfs(0,1);
	return 0;
 }