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>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;



int main(){
	int dt[10003];
	dt[0]=dt[1]=0;
	loop(i,2,10003)dt[i]=1;
	dt[10001]=dt[10002]=0;
	for(int i=2;i<100;i++){
		if(dt[i]==1){
			for(int j=2;i*j<10000;j++){
				dt[i*j]=0;
			}
		}
	}
	int n;
	while(1){
		cin>>n;
		if(n==0)break;
		int ans=0;
		rep(i,n-1){
			if(dt[i]==1 && dt[i+2]==1){
				ans=i;
			}
		}
		cout<<ans<<" "<<ans+2<<endl;
	}
	return 0;
}