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

n = int(input())
def is_prime(n):
    if n <= 2 and n>=1:
        return True
    elif n>2:
        for i in range(2, int(n**0.5)+1):
            if n%i == 0:
                return False
        return True
    else:
        return False
lst = [i for i in range(1,n)]
primes_lst = []
for i in lst:
    if is_prime(i) == True:
        primes_lst.append(i)
result = [0]*2
k = 0
f = len(primes_lst)-1-k
while k <= f:
    if primes_lst[k] + primes_lst[f]<n:
        k += 1

    elif primes_lst[k] + primes_lst[f]>n:
        f -= 1

    else:
        result[0] = primes_lst[k]
        result[1] = primes_lst[f]
        k += 1
        f -= 1
print(result[0])
print(result[1])