Write a program to check whether a number is prime in Java1 min read

Here is my solution to

Write a program to check whether a number is prime in Java

class Prime
{
  public static void main(String arg[])
  {
    int n,c=0;
 n=Integer.parseInt(arg[0]);
 for(int i=2;i<=n/2;i++)
 {
   if(n%i==0)
    c++;
    }
 if(c>0)
  System.out.println(n+" Is not prime no.");
 else
     System.out.println(n+" Is prime no.");	
  }
}

Output: