Prime Check in Java

1import java.util.Scanner;
2
3public class Main {
4    private static boolean isPrime(int n) {
5        if (n <= 1) return false;
6        if (n == 2) return true;
7        if (n % 2 == 0) return false;
8        for (int i = 3; i * i <= n; i += 2) {
9            if (n % i == 0) return false;
10        }
11        return true;
12    }
13
14    public static void main(String[] args) {
15        Scanner sc = new Scanner(System.in);
16        System.out.print("Enter a number: ");
17        int n = sc.nextInt();
18
19        if (isPrime(n)) {
20            System.out.println(n + " is Prime");
21        } else {
22            System.out.println(n + " is not Prime");
23        }
24        sc.close();
25    }
26}