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 main(){
long n,i,j,p[10001];
while(cin>>n){
if(n==0)break;
p[1]=0;
for(i=2;i<=n;i++)p[i]=1;
for(j=4;j<n;j+=2)p[j]=0;
for(i=3;i<=n;i+=2){
if(p[i]==1){
for(j=i*i;j<=n;j+=i)p[j]=0;
}
}
for(i=n;i>=4;i--)if(p[i]==1&&p[i-2]==1)break;
cout<<i-2<<" "<<i<<endl;
}
return 0;
}