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<vector>
#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
	bool era[10010]={false};
	for(int i=2;i<105;i++)if(!era[i])for(int j=i*i;j<10010;j+=i)era[j]=true;

	vector<int> p;
	for(int i=2;i<10010;i++)if(!era[i])p.push_back(i);

	for(int n;scanf("%d",&n),n;){
		int pos=distance(p.begin(),--upper_bound(p.begin(),p.end(),n));
		for(int i=pos;;i--){
			if(p[i]-p[i-1]==2){
				cout<<p[i-1]<<' '<<p[i]<<endl;
				break;
			}
		}
	}

	return 0;
}