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

char riga[100][251];
char empty[100];

int checktrigdown(int r,int s,int k) {
	int h,good,c,d;
	h=(k+1)/2;
	good=1;
	for(c=0;(c<h && good==1);c++) 
		for (d=s; ((d<(s+k-(2*c))) && (good==1));d++) {		
		
		
			if (riga[r+c][d]=='#') good =0;}
	return good;
}

int checktrigup(int r,int s,int k) {
	int h,good,c,d;
	h=(k+1)/2;
	good=1;
	for(c=0;(c<h && good==1);c++) 
		for (d=s; (d<(s+k-(2*c)) && good==1);d++) {
		
		
			if (riga[r-c][d]=='#') good =0;}
	return good;
}

int main()
{	FILE *in;
	int n,k,maxbase,trovato,maxstart,rlen,r,s,base,h;
	int cont;
	
	cont=1;
	in=fopen("triangle.in","r");
	fscanf(in,"%d",&n);
	while (n>0 && !feof(in)) {

	printf ("Triangle #%d\n",cont);
	trovato=0;
	for(k=0;k<n;k++) {
		fscanf(in,"%s",riga[k]);
	}
	maxbase=n+n-1;
	base=0;
	for(k=maxbase;((k>0) && (trovato==0));k-=2) {
		maxstart=(maxbase-k)/2;
		for(r=0;((r<=maxstart) && (trovato==0));r++) {
			rlen=(n-r)+(n-r)-1;
			for(s=0;((s<=(rlen-k)) && (trovato==0));s+=2) {

				if (checktrigdown(r,s,k)==1) {trovato=1;
					base=k;
					continue;
				}
				h=(k+1)/2;
				if(r>=(h-1) && (s+1)<=(rlen-k)) 
					if (checktrigup(r,s+1,k)==1) {trovato=1;
						base=k;
					}
			}
		}
	}
	printf ("The largest triangle area is %d.\n\n",((base+1)*(base+1))/4);
	cont++;
	fscanf(in,"%d",&n);
	}
	fclose(in);
	return 0;
}