Prime numbers are widely applied for cryptographic and communication technology. A twin prime is a prime number that differs from another prime number by 2. For example, (5, 7) and (11, 13) are twin prime pairs.

In this problem, we call the greater number of a twin prime "size of the twin prime."

Your task is to create a program which reads an integer n and prints a twin prime which has the maximum size among twin primes less than or equals to n

You may assume that 5 ≤ n ≤ 10000.



Input

The input is a sequence of datasets. The end of the input is indicated by a line containing one zero. Each dataset is formatted as follows:


n (integer)


Output

For each dataset, print the twin prime p and q (p < q). p and q should be separated by a single space.

Example

Input

12
100
200
300
0


Output

5 7
71 73
197 199
281 283
//Volume1-0150
import java.util.Scanner;

class Main {

    //declare
    private static final int       MAX = 10001;
    private static       boolean[] prm = new boolean[MAX];
    private static       int    [] twn = new int    [MAX];

	public static void main(String[] arg){

		initialize();

		//input
		Scanner sc = new Scanner(System.in);
		int n;
		while((n = sc.nextInt()) != 0){

			//output
			System.out.println(twn[n]-2+" "+(twn[n]));
		}
	}

    private static void initialize(){

    	//Creation of a prime number table.
        for(int i=0;i<MAX;i++){prm[i] = true;}
        prm[0] = false;
        prm[1] = false;
        for(int i=4;i<MAX;i+=2){prm[i] = false;}
        for(int i=3;i<MAX;i+=2){
            if(!prm[i]){continue;}
            for(int k=i*2;k<MAX;k+=i){
                prm[k] = false;
            }
        }

        //The table of twin primes is created.
        int twin = 5;
        for(int i=5;i<MAX;i++){
        	if(prm[i] && prm[i-2]){
        		twin = i;
        	}
        	twn[i] = twin;
        }
    }
}