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

import sys

def pure_number(v):
    if_pure = True
    for i in range(2, v):
        if v%i == 0:
            if_pure = False
            break
    
    return if_pure
    
s = int(input())

s1 = [i for i in range(2, int(s/2+1))]
s2 = [i for i in range(int(s/2), s)]

p1 = -1
p2 = 0
sum_12 = 0
sig = 0

while sum_12 != s and sig == 0:
    v1 = s1[p1]
    v2 = s2[p2]

    if v1 + v2 < s:
        p2 += 1
    elif v1 + v2 > s:
        p1 -= 1
    else:
        if pure_number(v1) != True:
            p1 -= 1
            sig = 0
        elif pure_number(v2) != True:
            p2 += 1
            sig = 0
        else:
            sig = 1

print(v1)
print(v2)