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 <vector>
int main(){
  std::vector<int> v;
  v.push_back(2);
  for(int i=3;i<=11000;i+=2){
    bool b = true;
    for(int j=0;i>=v[j]*v[j]&&b==true;j++){
      if(!(i%v[j]))b=false;
    }
    if(b)v.push_back(i);
  }
  int n;
  while(std::cin>>n){
    if(!n)return 0;
    for(int i=v.size()-1;i;i--)
      if(v[i]-v[i-1]==2&&v[i]<=n){std::cout<<v[i-1]<<" "<<v[i]<<std::endl;break;}
  }
}