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.*;
import java.lang.*;
import java.math.*;

public class Main {
	Scanner sc = new Scanner(System.in);
	
	boolean prime[] = new boolean[10001];
	int ans[] = new int[10001];
	void run(){
		Arrays.fill(prime,true);
		
		prime[0] = false;
		prime[1] = false;
		
		int value = 0;
		for(int i =0 ; i < 10001 ; i++){
			if(prime[i]){
				for(int j = i+i;j < 10001; j+=i){
					prime[j] = false;
				}
				if(prime[i-2]){
					value = i;
				}
			}
			ans[i] = value;
		}
		
		
		for(;;){
			int n = sc.nextInt();
			if(n == 0){
				break;
			}
			
			System.out.println((ans[n]-2)+" "+ ans[n]);
		}
		
	}
	public static void main(String[] args){
		Main m = new Main();
		m.run();
	}
}