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

import sys,math
table1,keylist = {},[]
def justsushu(a):
    if a == 1:return False
    if a == 2:return True
    else:
        for i in range(2,int(math.sqrt(a))+1):
            if a%i == 0:return False
        else:return True
for line in sys.stdin:
    a = int(line.strip())
    for i in range(a//2+1):
        if justsushu(i) and justsushu(a-i):
            keylist.append(a-2*i)
            table1[a-2*i] = [i,a-i]
min1 = min(keylist)
print(table1[min1][0])
print(table1[min1][1])