因式分解：求素数乘积

public class Main {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt()) {
            int n = in.nextInt();
            boolean hasPrime = false;
            for(int i=2; i<=Math.sqrt(n); i++){
                if(n / i * i == n && isPrime(i) && isPrime(n / i)){
                    hasPrime = true;
                    System.out.println(i + "," + n/i);
                }
            }
            if(!hasPrime) System.out.println("没有");
        }
    }

    public static boolean isPrime(int n){
        if(n == 2 || n == 3) return true;
        for(int i=2; i<=Math.sqrt(n); i++){
            if(n / i * i == n) return false;
        }
        return true;
    }
}