import java.util.Scanner;
//求2到n之间的所有素数
public class Test {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
if(n<2) {System.out.println(0);return;}
int[] retArr=getPrimeNumber(n);
StringBuilder buf=new StringBuilder();
for(int i=0;i<retArr.length;i++){
if(retArr[i] !=0){
//System.out.println(retArr[i]);
buf.append(retArr[i]).append(',');
}
}
String stra=buf.toString();
String str=stra.substring(0, stra.length()-1);
System.out.println(str);
}
public static int[] getPrimeNumber(int n) {
int[] retArr = new int[n+1];
boolean isPrime;
for (int i = 2; i <=n; i++) {
isPrime = true;
for (int j = 2; j < i; j++) {
if (i % j == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
retArr[i] = i;
}
}
return retArr;
}
}