import java.util.Scanner;
 
public class Main
{
    static boolean isPrime(int n) {
        //check if n is a multiple of 2
        if (n%2==0) return false;
        //if not, then just check the odds
        for(int i=3;i*i<=n;i+=2) {
            if(n%i==0)
                return false;
        }
        return true;
    }
 
public static void main(String[] args) {
        Scanner keyboard = new Scanner(System.in);
        System.out.println("Enter a number:");
        int theNum = keyboard.nextInt();
 
        System.out.println("\nThe prime factors of " + theNum + " are:");
 
        for(int i=1; i <= theNum/2; i++)
          if (theNum % i == 0 && isPrime(i))
            System.out.print(i + " ");
    }
}

aW1wb3J0IGphdmEudXRpbC5TY2FubmVyOwoKcHVibGljIGNsYXNzIE1haW4KewogICAgc3RhdGljIGJvb2xlYW4gaXNQcmltZShpbnQgbikgewogICAgICAgIC8vY2hlY2sgaWYgbiBpcyBhIG11bHRpcGxlIG9mIDIKICAgICAgICBpZiAobiUyPT0wKSByZXR1cm4gZmFsc2U7CiAgICAgICAgLy9pZiBub3QsIHRoZW4ganVzdCBjaGVjayB0aGUgb2RkcwogICAgICAgIGZvcihpbnQgaT0zO2kqaTw9bjtpKz0yKSB7CiAgICAgICAgICAgIGlmKG4laT09MCkKICAgICAgICAgICAgICAgIHJldHVybiBmYWxzZTsKICAgICAgICB9CiAgICAgICAgcmV0dXJuIHRydWU7CiAgICB9CgpwdWJsaWMgc3RhdGljIHZvaWQgbWFpbihTdHJpbmdbXSBhcmdzKSB7CiAgICAgICAgU2Nhbm5lciBrZXlib2FyZCA9IG5ldyBTY2FubmVyKFN5c3RlbS5pbik7CiAgICAgICAgU3lzdGVtLm91dC5wcmludGxuKCJFbnRlciBhIG51bWJlcjoiKTsKICAgICAgICBpbnQgdGhlTnVtID0ga2V5Ym9hcmQubmV4dEludCgpOwogICAgCiAgICAgICAgU3lzdGVtLm91dC5wcmludGxuKCJcblRoZSBwcmltZSBmYWN0b3JzIG9mICIgKyB0aGVOdW0gKyAiIGFyZToiKTsKICAgIAogICAgICAgIGZvcihpbnQgaT0xOyBpIDw9IHRoZU51bS8yOyBpKyspCiAgICAgICAgICBpZiAodGhlTnVtICUgaSA9PSAwICYmIGlzUHJpbWUoaSkpCiAgICAgICAgICAgIFN5c3RlbS5vdXQucHJpbnQoaSArICIgIik7CiAgICB9Cn0=

NTU=

55