#include <iostream>
using namespace std;
void findprimes(int n, int prime[])
{
int p[10000] = { 0 };
int num = 0;
for (int i = 2; i < 100000; i++)
{
if (p[i] == 0)
{
prime[num++] = i;
if (num > n) break;
}
for (int j = i + i; j < 100000; j += i)
{
p[j] = 1;
}
}
}
int main()
{
int prime[10000] = {0};
findprimes( 27, prime);
for (int i = 0; i < 5; i++)
{
cout << prime[i] << endl;
}
/*for (int i = m-1; m < n; i++) {
cout << prime[i] << endl;
}*/
}