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 get_input():
    while True:
        try:
            yield ''.join(input())
        except EOFError:
            break

MAX = 10001
primes = list()
for i in range(MAX):
    primes.append(True)
primes[0] = False
primes[1] = False

tprimes = [False for i in range(MAX)]

for i in range(2, MAX):
    j = i + i
    while j < MAX:
        primes[j] = False
        j = j + i

for i in range(2, MAX):
    if primes[i] and primes[i-2]:
        tprimes[i] = True

while True:
    n = int(input())
    if n == 0:
        break

    for i in range(n, -1, -1):
        if tprimes[i]:
            print(i-2, i)
            break

