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<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
	int a,s[10001],d,f,g,h,i,j;
	for(i=2;i<=10000;i++)	s[i]=1;
		s[1]=0;
	for(i=2;i<=10000;i++){
		if(s[i]==1){
			for(j=2;j<=5000;j++){
				if(i*j<=10000)
					s[i*j]=0;
			}
		}
	}
	while(1){
		d=0;
		f=0;
		scanf("%d",&a);
		if(a==0)	break;
		for(i=a;i>0;i--){
			if(s[i]==1){
				if(d==0) d=i;
				else f=i;
			}
			if(d!=0&&f!=0){
				if(d-f==2)
					break;
				d=f;
			}
		}
		printf("%d %d\n",f,d);
	}
	return 0;
}