import java.util.Scanner;
public class Prime {
public static void main(String[] args) {
/* 求素数等一系列问题 */
// 1.从2到x-1测试是否可以整除
Scanner in = new Scanner(System.in);
int x = in.nextInt();
boolean isPrime = true;
if(x == 1)
isPrime = false;
for(int i = 2; i < x ; i++) {
if(x % i == 0) {
isPrime = false;
break;
}
}
if(isPrime)
System.out.println(x+" is prime.");
else
System.out.println(x+" is not prime.");
}
}
import java.util.Scanner;
public class Prime {
public static void main(String