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;

int prime(int n, int k = 2)
{
    if(n < k * k) { return 1; }
    
    if(n % k == 0) { return 0; }
    
    return prime(n, k + 1);
}

int solve(int n)
{
    for(int i = n; i >= 3; i--)
    {
        if(prime(i) * prime(i - 2))
        {
            return i;
        }
    }
    
    return -1;
}

int main()
{
    int n;
    
    while(true)
    {
        cin >> n;
        
        if(n == 0) { break; }
        
        cout << solve(n) - 2 << ' ' << solve(n) << endl;
    }
    
    return 0;
}