import element.*;

public class sieve
{
    public static void main(String args[])
    {
        ConsoleWindow c = new ConsoleWindow();
        final int max = 100;
        boolean prime[] = new boolean[max+1];
        int n,m;

        // initialize the array (entries 0,1 unused)
        for (n = 2; n <= max; n++)
        {
            prime[n] = true;
        }
        // cross out multiples of uncrossed numbers
        for (n = 2; n <= max; n++)
        {
            if (prime[n]) {
                for (m = 2*n; m <= max; m += n)
                {
                    prime[m] = false;
                }
            }
        }
        // print out primes: uncrossed numbers
        for (n = 2; n <= max; n++)
        {
            if (prime[n]) {
                c.out.print(n+" ");
            }
        }
        c.out.println();
        System.exit(0);
    }
}
/*
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 
 */