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<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
using namespace std;

bool p[10001];
 
void seive(int s){
    for(int i=0;i<=s;i++)p[i]=true;
    p[0]=p[1]=false;
    for(int i=2;i<=s;i++){
        if(p[i]==true){
            for(int j=i*2;j<=s;j+=i)p[j]=false;
        }
    }
}
 
int main(){
   seive(10000);
   int n;
   while(cin>>n&&n){
       while(1){
           if(p[n]==true&&p[n-2]==true){
               cout<<n-2<<" "<<n<<endl;
               break;
           }
           n--;
       }
   }
    return 0;
}
