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

def f(x):  # 判断x是否是素数
    if x <= 2:
        return True
    for i in range(3, n // 2 + 1):
        if (x % i == 0) and (x != i):
            while x % i == 0:
                i += 1
                return False
    return True


n = int(input())  # n > 2
p = n
ls = []
for i in range(2, n // 2 + 1):
    #print(i)
    if f(i) and f(n - i):
        if abs(n - i - i) < p:
            p = abs(n - i - i)
            a = i
            b = n - i
            ls.append((i, n - i))
#print(ls)
print(a)
print(b)