[Silver 1] 6588번 골드바흐의 추측

import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        while(true) {
            int n = Integer.parseInt(br.readLine());
            if(n==0) { return; }
            boolean notExist = true;
            
            for(int i=2; i<=(n+1)/2; i++) {
                if(isPrime(i) && isPrime(n-i)) {
                    System.out.println(n + " = " + i + " + " + (n-i));
                    notExist = false;
                    break;
                }
            }
            
            if(notExist) { System.out.println("Goldbach's conjecture is wrong."); }
        }
    }
    
    public static boolean isPrime(int num) {
        if(num==1) { return false; }
        if(num==2 || num==3) { return true; }
        
        for(int i=2; i*i<=num; i++) {
            if(num%i==0) { return false; }
        }
        
        return true;
    }
}