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

def issushu(n):

    if n == 2:
        return True
    else:
        for i in range(2, int(n**0.5)+1):
            if n%i == 0:
                return False
        return True

def func():
    n = int(input())

    for i in range(int(n/2), n):
        if issushu(i) and issushu(n-i):
            print(n-i)
            print(i)
            break


if __name__ == "__main__":
    func()