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
import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);

		int[] prime=new int[1229];
		int counter=2;
		prime[0]=2;
		prime[1]=3;

		for(int i=5; i<=10000; i++) {
			for(int j=2; j*j<=i; j++) {
				if(i%j==0) {
					break;
				}
				if(i%j!=0 && (j+1)*(j+1)>i) {
					prime[counter]=i;
					counter++;
				}
			}
		}

		int[] fp=new int[205];
		int counter2=0;
		for(int i=0; i<1228; i++) {
			if(prime[i+1]-prime[i]==2) {
				fp[counter2]=prime[i];
				counter2++;
			}
		}

		while(true) {
			int a=sc.nextInt()-2;
			if(a==-2) {
				System.exit(0);
			}
			int max=0;

			for(int i=0; i<205; i++) {
				if(fp[i]<=a) {
					max=fp[i];
				}
				else if(fp[i]>a) {
					break;
				}
			}

			System.out.println(max+" "+(max+2));
		}
	}
}
