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

import schaums.dswj.Primes;

public class Pr0230
{ public static void main(String[] args) 
  { final int N=1000;
    Primes.setSize(N);
    int n=Primes.next();
    while (n<0.9*N)
    { if (Primes.isPrime(n+2))
        System.out.println(n + "\t" + (n+2));
      n = Primes.next();
    }
  }
}