// A Java application that prints the first 9 Fibonacci numbers.  Each
// Fibonacci number is marked as prime or composite as is appropriate.
// Fib[m] = Fib[m-2] + Fib[m-1], for m >= 3.

class PrimeFib {
     
     static final int MAX_INDEX = 10;	// A named constant

     public static void main( String[] args ) {

         int fib_m2 = 1;
         int fib_m1 = 1, fib_m;
         String evenMark;

         System.out.println( "1: " + fib_m2 );	// + is the string
						// concatenation operator
         for (int i = 2; i < MAX_INDEX; i++){
             System.out.print( i + ": " + fib_m1 );
             if ( isPrime( fib_m1 ) )
                System.out.println( " is prime" );
             else
                System.out.println( " is composite" );
             fib_m = fib_m2 + fib_m1;
             fib_m2 = fib_m1; fib_m1 = fib_m;	// Update for next loop
         }
     }

    public static boolean isPrime( int n ){
        if ( n == 1 ) return true;

        int i = 2;
        while ( i < Math.sqrt( n )  && n%i != 0 ) i++;
        
        return ( i >= Math.sqrt( n ) );
    }
}