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<cmath>
#include<iostream>
#define N 10002
using namespace std;
int eratos[N]; // [N]=0 -> N is prime
void createPrimeTable(){
	for(int i = 2; i < N; ++i){
		if( eratos[i] == 0 ){
			for(int j = 2; i * j < N; ++j){
				eratos[ i * j ] = 1;
			}
		}
	}
}
int main()
{
	createPrimeTable();
	while(true){
		int n;
		int p = 0;
		int q = 0;
		cin >> n;
		if( n == 0 ) break;
		for(int i = 3; i <= n - 2; ++i){
			if( eratos[ i ] == 0 && eratos[ i + 2 ] == 0 ){
				p = i;
				q = i + 2;
			}
		}
		cout << p << ' ' << q << '\n';
	}
	return 0;
}