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
#include<iostream>
#include<string>
using namespace std;

bool primenumver(int a){
	for (int b = 2;; b += 2) {
		if (a%b == 0)return false;
		if ((b + 1)*(b+ 1) >a)return true;
		if (b == 2)b--;
	}
}
int main() 
{
	while (1) {
		int a;
		cin >> a;
		if (a == 0)break;
		if (a % 2 == 0) {
			for (int b = a-1;; b -= 2) {
				if (primenumver(b) && primenumver(b - 2)) { cout << b - 2 << " " << b<<endl; break; }
			}
		}
		else {
			for (int b = a;; b -= 2) {
				if (primenumver(b) && primenumver(b - 2)) { cout << b - 2 << " " << b<<endl; break; }
			}
		}
	}
}