//palindrome2
#include <iostream>
#include <conio.h>
using namespace std;
#define n 100
int main()
{
int a;
char c[n][n];
freopen("Testcase.txt", "r", stdin);
for(int testcase = 1; testcase <= 10; testcase++)
{
int length;
int i, j;
cin >> a;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
cin >> c[i][j];
for(length = n; length > 0; length--)
{
int flag = 0;
for(i = 0; i < n; i++)
{
for(j = 0; j < n - length + 1; j++)
{
if(c[i][j] == c[i][j+length-1])
{
int k = j+1;
int l = j+length-2;
while(k < l)
{
if(c[i][k] == c[i][l])
{
flag = 1;
k++;
l--;
}
else
{
flag = 0;
break;
}
}
}
if(flag == 1)
break;
if(c[j][i] == c[j+length-1][i])
{
int k = j+1;
int l = j+length-2;
while(k < l)
{
if(c[k][i] == c[l][i])
{
flag = 1;
k++;
l--;
}
else
{
flag = 0;
break;
}
}
}
if(flag == 1)
break;
}
if(flag == 1)
break;
}
if(flag == 1)
{
cout << "#" << testcase << " " << length << endl;
break;
}
}
}
getch();
return 0;
}