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

import sys
from math import sqrt

n = int(input().strip())


def isSushu(a):
    for i in range(2, int(sqrt(a)) + 1):
        if a%i == 0:
            return False
    return True
L=[]
for i in range(2,(n//2)+1):
    if isSushu(i):
        L.append(i)
for x in range(len(L)-1,-1,-1):#从中间倒着查找，一旦发现合适就跳出

    if isSushu(n-L[x]):
        print(L[x])
        print(n-L[x])
        break