/*
 * @(#) msu95_e.c - Problem 'E' ("Map of characters") solution
 * of the ACM Programming Contest at the MSU in 1995.
 * (c) 1998 Ivan Maidanski <ivmai@chat.ru> http://ivmai.chat.ru
 * Freeware program source. All rights reserved.
 **
 * Language: ANSI C
 * Tested with: Borland C++ v3.1
 * Last modified: 1998-04-04 13:35:00 GMT+04:00
 */

/* Input data file: e.dat */

#include <stdio.h> /* FILE, EOF, fopen(), fscanf(), printf() */

int n;
char c;
char a[20][20];

int count(int i, int j)
{
 return i>=0 && j>=0 && i<n && j<n && a[i][j]==c?
        (a[i][j]=0,count(i-1,j)+count(i,j+1)+
                   count(i+1,j)+count(i,j-1)+1) : 0;
}

int main(void)
{
 int i,j;
 int s,bs;
 char bc;
 FILE *f=fopen("e.dat","rt");
 while (fscanf(f,"%*[^0-9]%d",&n)!=EOF && n>0 && n<=20)
 {
  for (i=0;i<n;i++)
   for (j=0;j<n;j++)
    fscanf(f,"%*[^A-Za-z]%c",&a[i][j]);
  bs=0;
  for (i=0;i<n;i++)
   for (j=0;j<n;j++)
    if (!!(c=a[i][j]) && (s=count(i,j))>bs)
    {
     bc=c;
     bs=s;
    }
  printf(" %c: %d\n",bc,bs);
 }
 return 0;
}