#include <stdio.h>
#include <math.h>
#include <string.h>

#define MAX(a,b) ((a>b)?(a):(b))
#define MIN(a,b) ((a<b)?(a):(b))
#define SQR(x) ((x)*(x))

int i,j,k,l,m,n,min,max,count,res;
FILE *in;
int p[512][512];
char c;

void quad(int y, int x, int s)
{
  fscanf(in,"%c",&c);
  switch (c)
    {
    case 'W':;
      for(i=y;i<y+s;i++)
	{
	  for(j=x;j<x+s;j++)
	    {
	      p[i][j]=0;
	    }
	}
      break;
    case 'B':;
      for(i=y;i<y+s;i++)
	{
	  for(j=x;j<x+s;j++)
	    {
	      p[i][j]=1;
	    }
	}
      break;
    case 'Q':;
      quad(y,x,s/2);
      quad(y,x+s/2,s/2);
      quad(y+s/2,x,s/2);
      quad(y+s/2,x+s/2,s/2);
      break;
    }
}

int main()
{
  in=fopen("quadtree.in","r");
  if (in==NULL)
    {
      printf("No input\n");
      return 1;
    }
  fscanf(in,"%d ",&n);
  quad(0,0,n);

  printf("#define quadtree_width %d\n",n);
  printf("#define quadtree_height %d\n",n);
  printf("static char quadtree_bits[] = {\n");
  for(i=0;i<n;i++)
    {
      for(j=0;j<n;j+=16)
	{
	  res=0;
	  for(k=0;k<8;k++)
	    {
	      res+=p[i][j+k]<<k;
	    }
	  printf("0x%x%x,",0xf&(res>>4),res&0xf);
	  res=0;
	  for(k=0;k<8;k++)
	    {
	      res+=p[i][j+k+8]<<k;
	    }
	  printf("0x%x%x,\n",0xf&(res>>4),0xf&res);
	}
    }
  printf("};\n");
  fclose(in);
  return 0;
}