#include<cstdio>

const int N=1<<20;
const int M=9973;

bool prim[N];
int nr=0,a[N];

void ciur()
{
	for (int i=2;i<N;i++)
		if (!prim[i])
		{
			nr++;
			a[nr]=i;
			for (int j=i*i;j<N;j+=i)
				prim[j]=true;
		}
}

int main()
{
	freopen("ssnd.in","r",stdin);
	freopen("ssnd.out","w",stdout);
	int n;
	scanf("%d",&n);
	ciur();
	return 0;
}