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 <algorithm>
#define N 10001
using namespace std;

int main(){
  int n;
  int p[N], pn=0;
  bool isPrime[N];

  for( int i=0;i<N;i++ ) isPrime[i]=true;

  for( int i=2;i<N;i++ ){
    if( !isPrime[i] ) continue;
    p[pn++] = i;
    for( int j=2*i;j<N;j+=i ) isPrime[j]=false;
  }

  while( cin>>n && n ){
    // nより大きい要素を指す最小のポインタ
    int *q=upper_bound( p,p+pn,n );
    q--;
    while( *q - *(q-1) != 2 ) q--;

    cout << *(q-1) << " " << *q << endl;
  }

  return 0;
}