#include <fstream.h>
#include <iostream.h>

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

#define oo 1000000000
#define PI 3.14159265389793
#define EPS 1e-9

#define DBG(x) x
#define PRINT(x) cout << (#x) << " = " << x << endl
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))


static char t[220][110];
static char a[220][110];
// static char b[220][110];
FILE *fp;
int nr = 0;
int n;

int rc(){
  fscanf(fp, "%d", &n);
  if (!n)
    return 0;
  for (int j=0; j<n; j++)
    for (int i=0; i<2*(n-j)-1; i++){
      char c;
      fscanf(fp, " %c", &c);
      t[i][j] = (c=='#')?0:1;
    }
  return 1;
} 


int test(){
  for (int j=1; j<n; j++)
    for (int i=0; i<2*(n-j)-1; i+=2)
      if (a[i][j] && a[i+1][j-1])
	a[i][j] = MIN(a[i][j-1], a[i+2][j-1])+1;

  int best = 0;
  for (int j=0; j<n; j++)
    for (int i=0; i<2*(n-j)-1; i++)
      best = MAX(best, a[i][j]);
  return best;
}

void sc(){
  int best = 0;

  for (int j=0; j<n; j++)
    for (int i=0; i<(2*(n-j))-1; i++)
      a[i][j] = t[i][j];


  best = MAX(test(), best);
  
  for (int j=0; j<n; j++)
    for (int i=0; i<(2*(n-j))-1; i++)
      a[2*(n-1)-i-j+(i%2)][i/2] = t[i][j]; 
// b[2*((n-1)-j)+(i%2)][i/2] = t[ i][ j];

  best = MAX(test(), best);
  /*
   for (int j=0; j<n; j++)
    for (int i=0; i<(2*(n-j))-1; i++)
      a[2*((n-1)-j)+(i%2)][i/2] =  b[ i][ j];
  

  best = MAX(test(), best);
  */
  int s = 0;
  for (int i = 1; i<= best; i++)
    s += (2*i)-1;

  printf("Triangle #%d\n", ++nr);
  printf("The largest triangle area is %d.\n\n", s);
}


int main(){
  fp = fopen("triangle.in", "r");
  
  while (rc()) sc();

  fclose(fp);

  return 0;
}