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

I can!

import sys

def prime(n):
    n=int(n)
    for i in range(2,n):
        if n % i == 0:
            return False
    return True
n=int(input())
n1 = n/2
while n1:
    n2 = n-n1
    if prime(n1) and prime(n2):
        print(int(n1))
        print(int(n2))
        break
    else:
        n1-=1