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

import java.util.*;

public class Main{
    public static boolean fun(int n){
        for(int i = 2; i <= (int)Math.sqrt(n); i++){
            if(n % i == 0){
                return false;
            } 
        }
        return true;
    }
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int min = n;
        for(int i = 2; i <= n/2; i++){
            if(fun(i) && fun(n-i)){
                if(Math.abs(n-i-i) < min){
                    min = Math.abs(n-i-i);
                }
            }
        }
        //a - b = min
        //a + b = max
        
        System.out.println((n-min)/2);
        System.out.println((n+min)/2);                 
    }
}