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

const int lim = 10000;
bool prime[lim+10];

int main(){
    int n;
    memset(prime,-1,sizeof(prime));
    for(int i = 3; i <= lim; i += 2)
        if(prime[i])
            for(int j = i*2 ; j <= lim; j += i)
                prime[j] = 0;

    while(cin >> n && n){
        if(n % 2 == 0) n--;
        for(int i = n; i >= 5; i -= 2){
            if(prime[i] && prime[i-2]){
                cout << i-2 << " " << i << endl;
                break;
            }
        }
    }
    return 0;
}