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<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;

int main(){
	bool prime[10001] = {}; prime[0] = prime[1] = true;
	for(int i=2;i<=10000;i++){
		if(prime[i]) continue;
		for(int j=2;i*j<=10000;j++){
			prime[i*j] = true;
		}
	}
	int N;
	while(cin>>N,N){
		int ans = 0;
		for(int i=2;i<=N;i++){
			if(!prime[i] && !prime[i-2]) ans = max(ans,i);
		}
		printf("%d %d\n",ans-2,ans);
	}
	return 0;
}