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
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {

	static Scanner scan = new Scanner(System.in);
	static PrintWriter out = new PrintWriter(System.out);

	static boolean[] prime = new boolean[10001];

	public static void main(String[] args) {
		ersis();
		while(true){
			int n = si();
			if(n==0) break;
			n -= (n+1)%2;

			do {
				if(!prime[n] && !prime[n-2]) break;
				n-=2;
			} while (n>=5);
			out.println(n-2+" "+n);
		}
		out.flush();
	}

	static void ersis(){
		prime[0] = prime[1] = true;
		for (int i = 0; i*i<10000 ; i++) {
			if(!prime[i])
				for (int j = i*2; j <= 10000 ; j+=i) {
					prime[j]=true;
				}
		}
	}

	static int si() {
		return Integer.parseInt(scan.next());
	}
}