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

import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stream;


public class Main {




        public static void main(String [] args) {

        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNext()) {

            int i = scanner.nextInt();
            int n=i/2;
            for (int i1 = n; i1 >0; i1--) {

                if(isPrime1(i1)&&isPrime1(i - i1)){

                        System.out.println(i1);
                        System.out.println(i-i1);
                        break;


                }

            }

        }}

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

    }


}