PrimeOrNotPrimeNumber

package Dcom;

import java.util.Scanner;

public class simpleOrNotSimpleNumber {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int number = Integer.parseInt(scanner.nextLine());
        boolean prime = number >= 2;

        for (int i = 2; i <= Math.sqrt(number) ; i++) {
            if (number % i == 0) {
                prime = false;
                break;
            }
        }
        if (prime) {
            System.out.println("Prime");
        } else {
            System.out.println("Not Prime");
        }
    }
}