check number is prime or not in java

Prime number program in java. Number is said to be Prime number if it has only two factors that is one and number it self. For example number 17 is prime as it has two factors only i.e  1 and 17 .

import java.util.Scanner;
public class Main
{

 public static void main(String[] args)
 {
  int N;
  Boolean Prime=false;
  Scanner input=new Scanner(System.in);
  System.out.println("enter N value:");
  N=input.nextInt();
  System.out.println("entered value is:"+ N);
  input.close();
  for(int i=2;i< N;i++)
  {
	if((N%i)==0)
	{
		Prime=true;
		break;
	}
  }

  if(Prime==true)
  {
	System.out.println("Number is not Prime");
  }
  else
  {
	System.out.println("Number is Prime");
  }
	
 }
}

OUTPUT:
enter N value:
10
entered value is:10
Number is not Prime
----------------------------------------------------
enter N value:
17
entered value is:17
Number is Prime