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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a = n / 2, b = n / 2;
        while (isNotPrime(a) || isNotPrime(b)) {
            a--;
            b++;
        }
        System.out.println(a);
        System.out.println(b);
    }

    private static boolean isNotPrime(int n) {
        int max = (int) Math.sqrt(n);
        for (int i = 2; i <= max; i++) {
            if (n % i == 0) {
                return true;
            }
        }
        return false;
    }
}