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;
typedef pair<int,int> PA;
int main(){
  bool sosu[10001];
  PA p,sou[10001];
  for(int i=3;i<=10000;i+=2){
    for(int j=i*i;j<=10000&&sosu[i]==false;j+=i)
      sosu[j] = true;
    if(sosu[i-2] == false && sosu[i] == false)
      p = PA(i-2,i);
    sou[i] = p;
  }
  int a;
  while(cin>>a,a!=0){
    if(a%2 == 0) a--;
    cout << sou[a].first << ' ' << sou[a].second << endl;
  }  
  return (0);
}