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
//150
#include <iostream>
#include <cstdio>
using namespace std;

int main(){

	const int x=10001;
	int p[x];
	int i,k,j,n;

	for(i=2; i<x; i++){
		p[i]=1;
	}
	p[0]=p[1]=0;
	for(i=2; i*i<=x; i++){
		if(p[i]){
			for(j=i*2; j<x; j+=i){
				p[j]=0;
			}
		}
	}

	while(1){

		cin >> n;
		if(!n){
			break;
		}

		for(k=n; k>0; k--){
			if(p[k] && p[k-2]){
				cout << k-2 << " " << k << endl;
				break;
			}
		}
	}

}