#include<fstream.h>
ofstream fout("divprim.out");
long prime[10001],T,N,K;
void gen_prime() {

	prime[10000] = 1;
	for (long d = 3; d < 10000; d+=2) {
		prime[d - 1] = 1;
		if (prime[d] == 0)
			for (long v= 2; v*d < 10000; v++)
				prime[d * v] = 1;
	}
	prime[2] = 0;
}
void danu(long N){
for (long j=0;j<=20;j++)       {
for (long i=j*500;i<j*500+500;i++){
   long x=i,nr=0;
   if (x%2==0)
      nr=1;
   for (long d=3;d<=x;d+=2)
      if (prime[d]==0)
	if (x%d==0)
	  nr++;
   fout<<nr<<",";}
   fout<<"\n";}
}
int main(){
gen_prime();
fout<<"{";
danu(10000);
fout<<"}";
fout.close();
return 0;
}