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

import math
num = int(input())
res = [0, 0]

def judge(num):
    for j in range(2, int(math.sqrt(num))+1):
        if num % j == 0:
            return False
    return True

for i in range(1, num//2+1):
    if judge(i):
        if judge(num-i):
                res[0], res[1] = i, num-i

print(res[0])
print(res[1])