#include<stdio.h>
int flg[10001];
int main(void){
	int n,i,j;
	while(1){
		scanf("%d",&n);
		if(n==0) break;
		for(i=2;i<=n;i++){
			if(flg[i]==0){
				for(j=i+i;j<=n;j+=i){
					flg[j]=1;
				}
			}
		}
		for(i=n;i>0;i--){
			if(flg[i]==0&&flg[i-2]==0){
				printf("%d %d\n",i-2,i);
				break;
			}
		}
	}
	return 0;
}
### Prompt

In cpp, your task is to solve the following problem:

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

### Response

```cpp
#include<stdio.h>
int flg[10001];
int main(void){
	int n,i,j;
	while(1){
		scanf("%d",&n);
		if(n==0) break;
		for(i=2;i<=n;i++){
			if(flg[i]==0){
				for(j=i+i;j<=n;j+=i){
					flg[j]=1;
				}
			}
		}
		for(i=n;i>0;i--){
			if(flg[i]==0&&flg[i-2]==0){
				printf("%d %d\n",i-2,i);
				break;
			}
		}
	}
	return 0;
}
```