import java.util.Arrays;
public class 判断素数 {
    public static void main(String[] args) {
        for(int i=100;i<=1000;i++){
            primeNumber(i);
        }
    }
    public static void primeNumber(int n){
        int [] array=new int[]{1,n};
        int i;
        for(i=2;i<n;i++){
            if(n%i==0){   
                array=Arrays.copyOf(array, array.length+1);
                array[array.length-1]=i;
                }
            }
        if(array.length>2){
            }
        else{
            System.out.println(n+"是素数");
        }
        }
    }