#include<iostream>
#include<fstream>
#include<cmath>
#include<iomanip>
 
using namespace std;
 
void sieve(__int64 arry[], __int64 upto) // finds prime num.
{	
 
 
	int next(0);
 
	for(__int64 i=0; i < upto; i++)//populate the arry starting from the value 2.
			arry[i] = i+2 ;
 
 
 
	for(__int64 k=1; k < upto;k++)
	{
		if(arry[k] >=1)
		{
			next = arry[k];
 
			for(int l = k+1 ; l <= upto ; l++)
 
				if(arry[l] % next==0)
					arry[l]=0;
		}
	}
 
for(__int64 i=0;i<=upto;i++)    //cout<< arry[] if it has a number greater than 0
 
	{
		if(arry[i]>0)
			cout<<arry[i]<<endl;
	}	
 
 
}
 
 
 
 
 
int main()
{
__int64 upto =200;   //This works but 2 million does not.
__int64 arry[201];    //same problem as above.
 
sieve(arry,upto);
 return 0;
}

 
__int64 arry[201];
 
// in 32 bit compiler will be
int arry[201];
 
// maks array size = 65535
 
__int64 arry[2000000];
 
// ?????

__int64 *array = new __int64[2000000];

delete []array;
array = NULL; // to make sure you do not use the pointer