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

n = input().strip()

n = int(n) >> 1

smaller = []
bigger = []


for l in range(n):
    cur = n - l
    is_prime = True
    for i in range(2, int(cur**0.5) + 1):
        if cur % i == 0:
            is_prime = False
            break
    if is_prime:
        smaller.append(cur)

for r in range(n):
    cur = n + r
    is_prime = True
    for i in range(2, int(cur**0.5) + 1):
        if cur % i == 0:
            is_prime = False
            break
    if is_prime:
        bigger.append(cur)

min_diff = 2 * n
min_s, min_b = 0, 0
for i in smaller:
    for j in bigger:
        if i + j == 2 * n:
            if j - i <= min_diff:
                min_diff = j - i
                min_s, min_b = i,  j
print(min_s, min_b, sep='\n')