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

from operator import sub
import sys

for line in sys.stdin:
    a = int(line.strip())


def su(n):
    lst = []
    if n<2:
        return 
    elif n==2:
        return True
    else:
        flag = True # 是
        for i in range(2,n): # 17
            if n%i==0:
                flag = False  # 不是
                break 
        if flag: # 是
            return True 
        else:
            return False 
# print(su(17))

# 存储 2...a之间的所有的素数 
lst = []
for i in range(2,a):
    if su(i):
        lst.append(i)
# print(lst)
res = []
for i in lst:
    for j in lst:
        if i+j == a and i<=j:
            res.append([i,j])
res = sorted(res,key=lambda x:(x[-1] - x[0]))
# print(res)
print(res[0][0])
print(res[0][1])