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
def prime(N):
    first=[True for i in range(N+1)]
    first[0],first[1]=False,False
    for i in range(2,int((N+1)**0.5)):
        if not first[i]:continue
        for j in range(i*2,N+1,i):first[j]=False
    return [i for i in range(N+1) if first[i]]

prime_number=prime(10000)
while 1:
    n=int(input())
    if n==0:break
    box=0
    for i,j in enumerate(prime_number):
        if j>n:break
        if prime_number[i]-prime_number[i-1]==2:
            box=max(box,prime_number[i])
    print(box-2,box)
