/**
 *	code to find prime numbers
 *
 *	javac -source 1.4 calcprimes.java
 *	java -ea calcprimes
 */

public class calcprimes {
	public static void main(String[] args) {

		int i;			//-- Checking to see if this number is prime
		int j;
		int prime;		// True or false

		for (i=3; i<=10000; i+=2){
			prime = 1; 			// Set prime to true
			j=3;

			while ( prime == 1 && (j <=Math.sqrt(i)) ){
				if( ( i % j ) == 0 ){
					prime = 0;	// number is not prime
				}
				j+=2;
			}
			//-- Print the primes
			if (prime == 1){
				System.out.println(i);
			}
		}
	}
}