New_Prime_Number

  Scanner key = new Scanner(System.in);
        System.out.println("Number: ");
        int divisor = 0;
        int n = Integer.parseInt(key.nextLine());
        //int divisor = 0;
        for (int i = 1; i <= n; i++) {
            if(n % i == 0){
            divisor++;}
        }
        if (divisor <= 2) {
            System.out.println("Prime");
        } else {
            System.out.println("Not prime");
        }
    }
}