// This is a very simple, numerical program in Java.
public class Primes {

	public static boolean isPrime(int n) {
		for (int j = 2; j < n; j++)
			if (n%j == 0)
				return false;
		return true;
	}
	
	public static void main(String[] args) {
		int max = 100;
		for (int i = 2; i < max; i++)
			if (isPrime(i))
				System.out.println(i);
	}

}