#include <iostream>

using namespace std;

const int N = 1e8 + 10; 

int prime[N]; 

int cnt; 


bool st[N];

int main(){
	
	int n;
	cin >> n;
	
	for (int i = 2; i <= n ; i ++ )
	{
		if (!st[i])  prime[cnt ++ ] = i;
		
		for (int j = 0; prime[j] < n / i; j ++ )
		{
			st[prime[j] * i]  = true;
			
			if (i % prime[j] == 0) break; 
		}	
	}
	
	long long res = 0;
	for (int i = 1; i < 100000000;i ++ )
	{
		cout << prime[i - 1] << endl;
		res += prime[i];
		
		if (res >= n)	
		{
			 cout << i << endl;
			 break;
		}
	}
	
}