【Java】输入一个正整数，判断它是不是一个素数

public class primeNumber {
  public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            System.out.println("输入一个数");
            int a = scanner.nextInt();
            if (a == 2) {
                System.out.println("是素数");
            }
            int i = 2;
            for (i = 2; i < a; i++) {
                if (a % i == 0) {
                    System.out.println(a + "不是素数");
                    break;
                }
            }
                if (i == a) {
                System.out.println(a + "是素数");
            }
        }
    }
}