//  Data Structures with Java by John R. Hubbard
//  Copyright McGraw-Hill, 2001
//  Problem 2.31 on page 51
//  Finding primes between squares

import schaums.dswj.Primes;

public class Pr0231
{ public static void main(String[] args) 
  { final int N=10000;
    Primes.setSize(N);
    for (int n=1; n<100; n++)
      for (int i=n*n+1; i<(n+1)*(n+1); i++)
        if (Primes.isPrime(i))
        { System.out.println(n*n + " < " + i + " < " + (n+1)*(n+1));
          break;
        }
  }
}