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<bits/stdc++.h>
using namespace std;
int n;
int memo[10001];
bool isPrime(int x) {
  if(memo[x]>=0) return memo[x];
  for(int i=2; i*i<=n; i++) {
    if(x % i == 0) return memo[x] = 0;
  }
  return memo[x] = 1;
}

int main() {
  fill(memo, memo+10000, -1);
  while(cin >> n && n) {
    int mx = 5;
    for(int i=2; i<=n-2 ; i++) {
      if((isPrime(i)&isPrime(i+2)) == 1) {
	mx = i;
      }
    }
    cout << mx << ' ' << mx+2 << endl;
  }
  
  return 0;
}