Check whether a given number is prime or not.

import java.util.Scanner;
class CheckPrime
{
boolean found=true;
void checkCheckPrime(int number)
{
for(int i=2;i*i<number;i++)
{
if(number%i==0)
{
found=false;
break;
}
}
if(found==true)
System.out.println("number is Prime");
else
System.out.println("number is not Prime");
}
}
class CheckPrimeTest
{
public static void main(String args[])
{
CheckPrime p1=new CheckPrime();
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number you want to insert:");
int n=sc.nextInt();
p1.checkCheckPrime(n);
}
}