/* Prime testing, top-down approach.
 * Program to print the prime numbers below 100.
 * 
 * Program written by Carsten Butz
 * September 2002
 */

import tio.*;

public class PrimeTopDown {

  public static void main (String[] args){

    for(int i = 1; i <= 100; i++)
      if(isPrime(i))
	System.out.println(i);

  }

  /* Method to return true if the number n is
   * a prime number, false otherwise.
   */
  public static boolean isPrime(int n){

    boolean flag = true;
    int d = 2;

    if(n==1)
      flag = false;

    while(d>=2 && d<=Math.sqrt(n) && flag){
      if(n%d==0)
	flag = false;
      d++;

    }
    return flag;

  }
}