题解 | #查找组成一个偶数最接近的两个素数#

import sys
def is_prime(n):
    for i in range(2, n//2):
        if (n % i == 0):
            return False
    return True
for line in sys.stdin.readlines():
    n = int(line)
    for i in range(n//2, 2, -1):
        if is_prime(i) and is_prime(n - i):
            print(i)
            print(n - i)
            break