import java.util.Scanner;
public class Prime {
public static void main(String args[]) {
System.out.println("請輸入壹個數字:");
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int count = 0;
if (isPrimes(num)) {
System.out.println(num + "是壹個質數!");
}
else {
System.out.println(num + "不是壹個質數!");
}
System.out.println(num+"後的3個質數為:");
num = num+1;
loop:while(count<3)
{
//num = num+1;
if(isPrimes(num))
{
System.out.println(num);
count++;
num++;
continue loop;
}
else
{
num++;
continue loop;
}
}
}
public static boolean isPrimes(int n) {
for (int i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}