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



char map[210][210];
char moins[210];

FILE *IN;



int Evolue_UP(int i, int j, int n){
  int x,y,len,max = 1;
  
  for(x = i-1, len =3 , y = j-1; x >= 0; x--, len+=2, y--) {
    if(!strncmp(&(map[x][y]) , moins, len)  ){
      max = len;
    }else{
      break;
    }
  }
  return max;
}

int Evolue_DOWN(int i, int j, int n){
  int x,y,len,max = 1;
  
  for(x = i+1, len =3 , y = j-1; x < n; x++, len+=2, y--) {
    if(!strncmp(&(map[x][y]) , moins, len)  ){
      max = len;
    }else{
      break;
    }
    
    if(map[x][y]==' '){
      break;
    }
  }
  return max;
}


int main(){
  int N2_1;
  int n,i,j,t;
  int Max, res;
  int nbr = 0;
  for(i=0;i<200;i++){
    moins[i] = '-';
  }
  IN = fopen("triangle.in","r");
  while(fscanf(IN, "%d\n", &n),n!=0){
    N2_1 = 2*n -1;
    Max = 0;
    nbr++;
    for(i=0;i<n;i++){
      fgets(map[i],200,IN);
    }
    
    
    for(i=n-1;i>=0;i--){
      if( Max < (2*i+1) ){
	for(j=i;j<N2_1-i;j++){
	  if((map[i][j] == '-')){
	    if((t=Evolue_UP(i,j,n))>Max){
	      Max = t;
	    }
	  }
	}
      }
    }
    for(i=0;i<n;i++){
      if(Max < (2*(n-i)+1) ){
	for(j=i;j<N2_1-i;j++){
	  if((map[i][j] == '-')  ){
	    if((t=Evolue_DOWN(i,j,n))>Max){
	      Max = t;
	    }
	  }
	}
      }
    }
    printf("Triangle #%d\n"  ,nbr );
    res = (Max+1)/2; 
    res *= res;
    printf("The largest triangle area is %d.\n\n"  , res);
    
    
  }
  
  
  fclose(IN);
  
  
  
  
  
  
  return 0;
  
}