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[] args) {
		Scanner sc = new Scanner(System.in);

			while(sc.hasNext()) {
				int n = sc.nextInt();
					if (n == 0) {
						break;
					}

				boolean[] arr = new boolean[n + 1];
				int limit = (int)Math.sqrt(arr.length);
				prime(arr, limit, n);
			}
		sc.close();


	}

	private static void prime(boolean[] arr, int limit, int n) {
		for (int j = 2 ; j <= limit; j++) {
			for(int k = 2; k * j < arr.length; k++) {
				arr[k * j] = true;
			}
		}
		arr[0] = arr[1] = true;

		for (int i = n; i > 2; i--) {
			if (arr[i] == false && arr[i - 2] == false) {
				System.out.printf("%d %d\n", i - 2, i);
				break;
			}
		}
	}
}
