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

import java.util.*;

public class Main {


    private static boolean isPrime(int num) {//判断是否为素数
        for (int i = 2; i <= num/i; i++) {
            if (num % i == 0) return false;
        }
        return true;
    }

    public static int count(int n) {//从最中间找素数，即为差值最小的，显然j<i
        int i = n/2, j = n - i;
        while (!isPrime(i) || !isPrime(j)) {
            i++;
            j--;
        }
        return j;
    }

    public static void main(String[] args) {
        
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            int n = in.nextInt();
            int res = count(n);
            System.out.println(res);
            System.out.println(n - res);
        }
    } 
}