/* Subject: Contest submission for problem #1, file 1.c */
/* cs169-ta@imail.EECS.Berkeley.EDU */
/* Mon Sep  8 01:18:42 PDT 2003 */
/*___CONTEST_SUBMISSION___ cs169-ta 1 */
#include "contest.h"

struct letter{
  char letter;
  int triangles;
};

struct letter newLetter(char letter){
  struct letter temp;
  temp.letter=letter;
  temp.triangles=0;
  return temp;
  }


int getLetterIndex(struct letter letters[], int letterIndex, char temp){
  

   int k;    
  for(k=0;k<letterIndex;k++){
   if(letters[k].letter == temp){
        printf("");
      return k;}
     }
}


int countIsoc1(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;

  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      //      printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
       
	for(column=0; column<size+1; column++){

	  for(row=0; row<size+1-column; row++){
	    //	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
	    if(matrix[i][j]!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	    }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	}

	  if(tri=='y'){

	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    count++;
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}


int countIsoc2(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){

      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
       
	for(column=0; column<size+1; column++){

	  for(row=column; row<size+1; row++){
	    //    	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
	    if(matrix[i][j]!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	    }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	}

	  if(tri=='y'){
	    	    letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;

	    	    count++;
		    // printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}



int countIsoc3(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      //  printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
       
	for(column=0; column<size+1; column++){

	  for(row=0; row<column+1; row++){
	    //    	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
	    if((temp=matrix[i][j])!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	    }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	}

	  if(tri=='y'){
	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    	    count++;
		    // printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}


int countIsoc4(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      //   printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
       
	for(column=0; column<size+1; column++){

	  for(row=0; row>-(column+1); row--){
	    //    	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
	    if((temp=matrix[i][j])!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	    }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	}

	  if(tri=='y'){
	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    	    count++;
		    // printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}



int countEqual1(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,abscol,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      //   printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
       
	for(column=-size; column<size+1; column++){
	  if(column<0)
	    abscol=-column;
	  else abscol=column;

	  for(row=abscol; row<size+1; row++){
	    //    	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
	    if((temp=matrix[i][j])!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	    }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	}

	  if(tri=='y'){
	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    	    count++;
		    // printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}

int countEqual2(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,absrow,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      // printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
	
	  for(row=-size; row<size+1; row++){
	
	  if(row<0)
	    absrow=-row;
	  else absrow=row;


	  	    for(column=absrow; column<size+1; column++){
	  
		      //    	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
			  if((temp=matrix[i][j])!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	      }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	    }

	  if(tri=='y'){
	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    	    count++;
		    // printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}


int countEqual3(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,column,abscol,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      // printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
       
	for(column=-size; column<size+1; column++){
	  if(column<0)
	    abscol=-column;
	  else abscol=column;

	  for(row=-size; row<-abscol+1; row++){
	    //        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
	    if((temp=matrix[i][j])!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	    }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	}

	  if(tri=='y'){
	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    	    count++;
		    //		     printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}

int countEqual4(char matrix[20][20], int dimension, struct letter letters[], int letterIndex){
  int i,j,m,column,absrow,row;
  char tri='y';
  int count=0;
  int size=1;
  char temp;
  
  //for each element of the array
  for(i=0;i<dimension;i++){
    for(j=0;j<dimension;j++){
      //   printf("\n\nwe are on %i %i\n", i, j);
      //keep checking for iso1 triangles of increasing size
      size=1;
      while(1){
	//assume at first that it is a triangle
	tri='y';
	
	
	  for(row=-size; row<size+1; row++){
	
	  if(row<0)
	    absrow=-row;
	  else absrow=row;


	  	    for(column=-size; column<-absrow+1; column++){
	  
		      //	          	        printf("comparing %c %i %i, with %c %i %i\n", matrix[i][j], i, j, matrix[i+row][j+column], i+row, j+column);
			  if(matrix[i][j]!=matrix[i+row][j+column]){
	      //if we find out it isn't, record so
	      tri='n';
	      
	      break;
	      }
	    if(tri=='n')
	      break;
	  }
	  if(tri=='n')
	    break;
	    }

	  if(tri=='y'){
	      letters[getLetterIndex(letters, letterIndex, matrix[i][j])].triangles++;
	    	    count++;
		    // printf("%i triangle found!\n", count);
		    size++;
	  }
	  else
	    break;
      }

    }
  }
  return count;
}


int contains(struct letter letters[], char temp){
  int k;    
  for(k=0;k<20;k++){
    if(letters[k].letter == temp){
      return 1;
      printf("letter found at %i\n", k);
    }
  }
      return -1;
}

main(){
  char line[100];
  int dimension;
  char matrix[20][20];
  struct letter letters[20];
  int letterCounter=0;
  int count;
  int i,j,k;

    while(gets(line)){

  sscanf(line, "%i", &dimension);

  for (i=0; i<letterCounter+1; i++)
    letters[i].letter=' ';
  letterCounter=0;

  if(dimension!=0){

  for(i=0; i<dimension; i++){
    gets(line);
    for(j=0;j<dimension; j++){
      matrix[i][j]=line[j];
         if((contains(letters, matrix[i][j])) == -1){
    	letters[letterCounter]=newLetter(matrix[i][j]);
    	letterCounter++;

    	}
    }

  }
    
  count = countIsoc1(matrix, dimension, letters, letterCounter) + countIsoc2(matrix, dimension, letters, letterCounter) + countIsoc3(matrix, dimension, letters, letterCounter) + countIsoc4(matrix, dimension, letters, letterCounter) + countEqual1(matrix, dimension, letters, letterCounter) + countEqual2(matrix, dimension, letters, letterCounter) + countEqual3(matrix, dimension, letters, letterCounter) + countEqual4(matrix, dimension, letters, letterCounter);


      printf("(%i)", count);
            for (i=0;i<letterCounter;i++){
       	printf(" %i %c", letters[i].triangles, letters[i].letter);}
      printf("\n");

  }

    }

  printf("\n");
  exit(0);
}