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

def isPrime(num):
    for i in range(2, num):
        if num % i == 0:
            return False
    return True

while True:
    try:
        n = int(input())
        mid = n // 2
        min_diff = 1000
        resnum1, resnum2 = 0, 0
        for i in range(2, mid+1):
            num1 = n-i
            num2 = i
            if isPrime(num1) and isPrime(num2):
                diff = abs(num1-num2)
                if diff < min_diff:
                    min_diff = diff
                    resnum1 = min(num1, num2)
                    resnum2 = n - resnum1
        print(resnum1)
        print(resnum2)

    except:
        break