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<vector>
#include<cmath>
using namespace std;
int main(){
  vector<int>prime;
  prime.push_back(2);
  for(int i=3;i<10000;i+=2){
    int flag=1;
    for(int j=2;j<=sqrt(i);j++){
      if(i%j==0){
	flag=0;
	break;
      }
    }
    if(flag)
      prime.push_back(i);
  }
  int n;
  while(cin>>n,n){
    for(int i=prime.size();i>0;i--){
      if(prime[i]<=n&&(prime[i]-prime[i-1])==2){
	cout<<prime[i-1]<<" "<<prime[i]<<endl;
	break;
      }
    }
  }
  return 0;
}