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

import re
n=int(input())
a1=0
def sushu(x):
    if x <=2:
        return True
    
    for i in range(2,int(x**0.5+1)):
            if x%i==0:
                return False
            
    return True
for i in range(int(n/2),n):
    if sushu(i) and sushu(n-i):
        if i>n-i:
            i=n-i
        print(i)
        print(n-i)
        break
废了老大劲了