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
P = []
for n in range(10000):
    p = 3
    c = 0
    if n % 2 == 0:
        c += 1
    else:
        while p < int(n**0.5) + 1:
            if n % p != 0:
                p += 2
            else:
                c += 1
                break
    if c == 0:
        P.append(n)

P.reverse()

while 1:
        j = 0
        n = int(input())
        if n == 0:
            break
        else:
            for i in range(len(P)):
                if n >= P[i]:
                    j = i
                    break
            while 1:
                if P[j]-2 == P[j+1]:
                    print(P[j+1],P[j])
                    break
                else:
                    j += 1

