素数距离问题

import java.util.Scanner;
public class acm24 {
public static boolean judge(int a){
boolean flag=true;
if(a<2){
return false;
}
else{
for(int i=2;i<=Math.sqrt(a);i++){
if(a%i==0){flag=false;break;}
}
}
return flag;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner input=new Scanner (System.in);
int f=input.nextInt();
while(f>0&&f<=10000){
Scanner input1=new Scanner (System.in);
int f1=input1.nextInt();
int m=f1,n=f1;

if(judge(f1)==true){
System.out.print(f1);
System.out.print(' ');
System.out.println(0);
}
else
{
boolean is=true;
while(is){
n--;
m++;
if(judge(n)==true&&judge(m)!=true||judge(n)==true&&judge(m)==true){
System.out.print(n);
System.out.print(' ');
System.out.println((f1-n));is=false;
}
if(judge(n)!=true&&judge(m)==true){
System.out.print(m);
System.out.print(' ');
System.out.println((m-f1));is=false;
}


}


}
--f;
}
}
}