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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int num = Integer.MAX_VALUE;
        for (int i = 1; i <= a/2; i++) {
            if(isPrime(i)&&isPrime(a-i)) {
                num = Math.min(num, (a - i));
            }
        }
        System.out.println(a-num);
        System.out.println(num);
    }

    public static boolean isPrime(int num) {
        if (num <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}