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>
using namespace std;

#define MAX 10002
#define sqrtMAX 100

int main()
{
	bool b[MAX+1] = {0};
	int i, j;
	b[0] = 1;
	b[1] = 1;
	for(i=4; i<=MAX; i+=2) b[i] = 1;
	for(i=3; i<=sqrtMAX; i+=2)
		for(j=i+i; j<=MAX; j+=i) b[j] = 1;

	int p[MAX+1] = {0};
	j = 5;
	for(i=5; i<MAX-2; i+=2) {
		p[i] = j;
		p[i+1] = j;
		if ( !(b[i]|b[i+2]) ) j = i+2;
	}

	while (cin>>i, i) cout<<p[i]-2<<" "<<p[i]<<endl;

	return 0;
}