/* SELFREF */

main(int argc,char* argv[]) {
 int i,j,k,t,n,m,x[10],y[10],nbof[10][26];
 if(argc>1) n=atoi(argv[1]);
 switch(n) {
  case 4: m=14;break;
  case 5: m=16;break;
  case 6: m=18;break;
  case 7: m=20;break;
  case 8: m=22;break;
  case 9: m=24;break;
  case 10: m=26;break;
  default: printf("Usage: selfref n\n   n between 4 and 10\n");return;
 }
 i=0;j=0;
 while(n*i+j<m) {
  nbof[0][n*i+j]=(j==0);
  for(k=1;k<n;k++) nbof[k][n*i+j]=(i==k)+(j==k);
  j++;if(j==n) {j=0;i++;}
 }
 for(i=0;i<n;i++) x[i]=1;
 do {
  /* successor of x */
  for(i=0;i<n;i++) {
   y[i]=1;
   for(j=0;j<n;j++) y[i]+=nbof[i][x[j]];
  }
  /* sort y0<=y1<=y2<=y3... */
  for(j=1;j<n;j++) {
   t=y[j];i=j-1;
   while((i>=0)&&(t<y[i])) {
    y[i+1]=y[i];i--;
   }
   y[i+1]=t;
  }
  /* check if solution */
  k=n-1;while((k>=0)&&(x[k]==y[k])) k--;
  if(k<0) {
   /* solution; recalculate y */
   for(i=0;i<n;i++) {
    y[i]=1;for(j=0;j<n;j++) y[i]+=nbof[i][x[j]];
   }
   printf("Solution (base %d): ",n);
   for(i=0;i<n-1;i++) printf("%d,",y[i]);
   printf("%d\n",y[n-1]);
  }
  /* increment x */
  k=n-1;while(++x[k]==m) k--;
  for(j=k;j<n-1;j++) x[j+1]=x[k];
 } while(k>=0);
}