class Sieve {
    public static void main(String args[]) {
	int n = 100;
	boolean[] prime = new boolean[n+1];
	prime[1] = false;
	for(int i=2; i<=n; i++)
	    prime[i] = true;
	for(int i=2;i<=Math.sqrt(n);i++)
	    if(prime[i])
		for(int j=2*i; j<=n; j+=i)
		    prime[j] = false;
	for(int i=1; i<=n; i++)
	    if(prime[i])
		System.out.print(i + " ");
	System.out.println();
    }
}