using System;

public class Program

{

    public static void Main()

    {

        //coded by Chris Lawson

        //'n' will count upwards to 1000 when 'i' is equal to it, serving as a timer to stop the program when 1000 is reached 

        // and also serving as the number whose prime status is in question

        //'i' will be modded into 'n' to check 'n's prime status.  it will raise every loop until it is equal to half of 'n', and then will drop back down to 1

        // this will let 'i' go through every number below half of 'n', there by determining 'n's prime status

        //'x' will be the mod of n and i.  it will determine if 'n' is prime, and if 'n' = 'i' with 'x' never equalling 0, then the number was prime

        int n = 2;

        int i = 0;

        do

        {

            i++;

            int x = n%i;

            if (n == i)

            {

                Console.WriteLine("" + n + "");

                n++;

                i = 1;

            }

            else if (x == 0)

            {

                n++;

                i = 1;

                continue;

            }           

        }

        while (n < 1000);

    }

}