/* Subject: Contest submission for problem #1, file 1.cc */
/* koulchin@imail.EECS.Berkeley.EDU */
/* Thu Sep 11 13:48:13 PDT 2003 */
/*___CONTEST_SUBMISSION___ koulchin 1 */
// Triangles.
// Estimated time: 40 minutes
// Starting time: 12:15
// Ending time: 1:35, with 5 minutes break
// Actual time: 1:15
//              32 minutes coding, the rest debugging my math

#include <stdio.h>

char matrix[20][21]; // given N<=20, one extra character for null terminator
int size;
int triangles[26];

// retrieve the letter at the position, with bounds checking
char GetLetter(int x, int y);

// check if triangle of given type exists at given position
int CountTriangles(int x, int y, int type);

int main()
{
  int n, k, j, sum, count;
  scanf("%d", &size);
  while (size > 0)
    {
      for (n=0; n<26; n++)
	triangles[n] = 0; // init counters
      sum = 0;
      for (n=0; n<size; n++)
	scanf("%s", matrix[n]); // read data
      for (n=0; n<size; n++)
	for (k=0; k<size; k++)
	    for (j=0; j<8; j++) // run the algorithm
	      {
		count = CountTriangles(n, k, j);
		triangles[GetLetter(n, k)-'A'] += count;
		sum += count;
	      }
      printf("(%d)", sum); // print results
      for (n=0; n<26; n++)
	if (triangles[n] != 0)
	  printf(" %d %c", triangles[n], n+'A');
      printf("\n");
      scanf("%d", &size); // prime next loop
    }
}

int CountTriangles(int x, int y, int type)
{ // returns the number of triangles of specified type at specified location
  // essentially, has to find the biggest triangle of that type and return its size
  int j, count, t_size;
  char letter = GetLetter(x, y);
  if (letter == 0) return 0; // got invalid x,y for some reason
  switch (type)
    { // note: I could probably save some lines by moving the loops outside the case
      // and moving the case and GetLetter into another wrapper function. I could also
      // remove these comments and probably gain ~10 lines over the entire file...
    case 0:                         // A
      for (t_size=1;;t_size++)      // AA
	for (j=0; j<=t_size; j++)
	  if (GetLetter(x+j, y+t_size) != letter)
	    return t_size-1; // triangle of t_size size doesn't exist
    case 1:                        //  A
      for (t_size=1;;t_size++)     // AA
	for (j=0; j<=t_size; j++)
	  if (GetLetter(x-j, y+t_size) != letter)
	    return t_size-1; // triangle of t_size size doesn't exist
    case 2:                        // AA
      for (t_size=1;;t_size++)     // A
	for (j=0; j<=t_size; j++)
	  if (GetLetter(x+t_size-j, y+j) != letter)
	    return t_size-1; // triangle of t_size size doesn't exist
    case 3:                        // AA
      for (t_size=1;;t_size++)     //  A
	for (j=0; j<=t_size; j++)
	  if (GetLetter(x-t_size+j, y+j) != letter)
	    return t_size-1;
    case 4:                        //  A
      for (t_size=1;;t_size++)     // AAA
	for (j=0; j<=t_size; j++)
	  if ((GetLetter(x+j, y-t_size+j) != letter) ||
	      (GetLetter(x-j, y-t_size+j) != letter))
	    return t_size-1; // triangle of t_size size doesn't exist
    case 5:                        // AAA
      for (t_size=1;;t_size++)     //  A
	for (j=0; j<=t_size; j++)
	  if ((GetLetter(x+j, y+t_size-j) != letter) ||
	      (GetLetter(x-j, y+t_size-j) != letter))
	    return t_size-1; // triangle of t_size size doesn't exist
    case 6:
      for (t_size=1;;t_size++)
	for (j=0; j<=t_size; j++)
	  if ((GetLetter(x+t_size-j, y-j) != letter) ||
	      (GetLetter(x+t_size-j, y+j) != letter))
	    return t_size-1; // triangle of t_size size doesn't exist
    case 7:
      for (t_size=1;;t_size++)
	for (j=0; j<=t_size; j++)
	  if ((GetLetter(x-t_size+j, y+j) != letter) ||
	      (GetLetter(x-t_size+j, y-j) != letter))
	    return t_size-1; // triangle of t_size size doesn't exist
    default: // invalid argument
      fprintf(stderr, "Invalid arg to CountTriangles\n");
      return 0;
    }
  return t_size-1; // found t_size-1 triangles, should be unreachable
}

char GetLetter(int x, int y)
{ // makes it so I don't have to do bounds checking in real code
  if (x<0 || y<0 || x>=size || y>=size)
    return 0;
  else
    return matrix[y][x];
}