Prime Number using Java

import java.util.Scanner;

public class PrimeNumber {
    static void checkPrime(int n)
    {
        int m= 0, flag = 0;
        m = n /2;
        if(n == 0 || n == 1)
        {
            System.out.println(n+" is not Prime Number.");
        }
        else {
            for(int i = 2;i <= m;i++)
            {
                if(n % i == 0)
                {
                    System.out.println(n+" is not Prime Number.");
                    flag = 1;
                    break;
                }
            }
            if(flag == 0)
            {
                System.out.println(n+" is Prime Number.");
            }
        }
    }
    public static void main(String[] args) {
        System.out.println("Enter any Number: ");
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        checkPrime(num);
        sc.close();
    }

}