// Prime Number Generator

#include<iostream>

using namespace std;

int main()
{
    int limit = 1000;
    int totalPrime = 0;

    for(int i = 1; i <= limit; i++)
    {
        // Not a prime if i < 2

        if(i < 2 ) continue;

        // Prime if i equals 2

        if(i == 2)
        {
            cout << i << " ";
            totalPrime++;
        }

        // Not Prime if i is even

        if(i % 2 == 0) continue;

        // Check for odd numbers

        int j;
        for(j = 3; j <= i - 2; j += 2)
        {
            if(i % j == 0)
            {
                break;
            }
        }

        if( j == i )
        {
            cout << i << " ";
            totalPrime++;
        }
    }

    cout << "\nTotal prime found : " << totalPrime << endl;

    return 0;
}