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.util.Scanner;

public class Main{
	public static void main(String srgs[]) {
		Scanner sc = new Scanner(System.in);
		int prime[] = new int[10001];
		int n;

		prime[0] = -1;
		prime[1] = -1;
		for (int i = 2; i < 10001; i++) {
			for (int j = i; i * j < 10001; j++) {
				prime[i * j] = -1;
			}
		}

		while (sc.hasNext()) {
			n = sc.nextInt();
			for (int i = n; 0 <= i; i--) {
				if (0 <= i - 2 && prime[i] == 0 && prime[i - 2] == 0) {
					System.out.println((i - 2) + " " + i);
					break;
				}
			}
		}
	}
}