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 math

MAX = 10000


def is_prime_number(num):
    for divisor in range(3, int(math.sqrt(num) + 1), 2):
        if num % divisor == 0:
            return False

    return True


def create_prime_number_list(max):
    prime_number_list = list(range(0, max + 1))

    prime_number_list[0] = False
    prime_number_list[1] = False

    for index in range(2 * 2, max + 1, 2):
        prime_number_list[index] = False

    for num in range(3, int(math.sqrt(max + 1)), 2):

        if is_prime_number(num):
            for index in range(num * 2, max + 1, num):
                prime_number_list[index] = False

    return prime_number_list


prime_number_list = create_prime_number_list(MAX)
output = []

while True:

    num = int(input())

    if num == 0:
        break

    if num % 2 == 0:
        num -= 1

    for index in range(num, 0, -2):
        if prime_number_list[index - 2] and prime_number_list[index]:
            output.append(str(index - 2) + " " + str(index))
            break

print("\n".join(output))

