//15.显示素数(for循环)
import java.util.Scanner;
public class Zuoye_15 {
public static void main(String[] args) {
Scanner Dcy=new Scanner(System.in);
int count=0,number=2;
System.out.print("求n以内的素数 n=");
int n=Dcy.nextInt();
while(number<=n) {
boolean isprime=true;
for(int divisor=2;divisor<=number/2;divisor++) {
if(number%divisor==0) {
isprime=false;
break;
}
}
if(isprime) {
count++;
if(count%10==0) {
System.out.println(number);
}else {
System.out.print(number+" ");
}
}
number++;
}
}
}