import java.util.Scanner;

public class OscarPrimesTest
{

    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        System.out.println("Please enter a number");
        int userNumber = in.nextInt();

        for(int i = 2; i < userNumber; i++)
        {
            if(isPrime(i))
            {
                System.out.println(i);
            }
        }
    }
    public static Boolean isPrime(int testInt)
    {
        int[] primeArray = new int[testInt - 1];
        int primeCount = 0;
        for(int i = 2; i <= testInt; i++)
        {
            primeArray[i - 2] = testInt % i;
        }

        for(int z = 0; z < primeArray.length; z++)
        {
            if (primeArray[z] == 0)
            {
                primeCount++;
            }
        }

        return primeCount == 1;
    }
}