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

n = int(input())
lis1 = []#找到素数列表
for num in range(2, 1001):
    for i in range(2, int(num**0.5) + 1):
        if num % i == 0:
            break
    else:
        lis1.append(num)
lis2 = [float('-inf'),float('inf')]
for i in range(len(lis1)):
    for j in range(len(lis1)):
        if lis1[i] + lis1[j] == n:
            if abs(lis1[i] - lis1[j]) < abs(lis2[0] - lis2[1]):#找到最小的素数组合
                lis2 = [lis1[i],lis1[j]]
for i in lis2:
    print(i)