Additive Prime Number

import java.io.*;

class Solution {

static boolean isPrime(int n) 
{ 
if (n <= 1) 
return false; 
for (int i = 2; i < n; i++) 
if (n % i == 0) 
return false; 
return true; 
} 

public static void main(String[] args) {
int num1=0;
int num2=0;
try {
num1 = Integer.parseInt(args[0]);
}
catch (NumberFormatException nfe) {
System.out.println("first argument should be a number");
System.exit(1);
}
catch(ArrayIndexOutOfBoundsException e) {
System.out.println("first number is missing");
System.exit(1);
}

try {
num2 = Integer.parseInt(args[1]);
}
catch (NumberFormatException nfe) {
System.out.println("second argument should be a number");
System.exit(1);
}
catch(ArrayIndexOutOfBoundsException e) {
System.out.println("second number is missing");
System.exit(1);
}
if(num1>num2)
{
System.out.println("first number should be less than equal to second number");
System.exit(1); 
}
int count=0;
for(int i=num1;i<=num2;i++)
{
int temp=i;
int sum=0;
while(temp>0)
{
sum=sum+temp%10;
temp=temp/10;
}
if(isPrime(sum) && isPrime(i))
{
System.out.print(i+" ");
count++;
}

}
if(count==0)
System.out.print("not found");

}
}