查找组成偶数最接近的两个素数

def solve(n):
    n = int(n)
    def is_prime(x):
        if x < 2:
            return False
        for i in range(2, int(x ** 0.5) + 1):
            if x % i == 0:
                return False
        return True
    for i in range(n // 2, 1, -1):
        if is_prime(i) and is_prime(n - i):
            print(i)
            print(n - i)
            return