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

n = int(input())
L = int(n/2)
a = 0
b = 0
def is_prime(k):
    if k in [2,3,5,7]:
        return True
    elif k < 11:
        return False
    else:
        for i in range(2, int(k/2)):
            if k % i == 0:
                return False
        return True
for i in range(L):
    k = L - i
    if is_prime(k) and is_prime(n-k):
        a = k
        b = n - k
        break
print(a)
print(b)