#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;

char *mem;
int *vis, *q;
int D;
int Ds[25];

int k[27];


int vlna(int f, int t) {
  int qs=0, qe=0;
  q[qe++]=f;
  vis[f]=1;
  memset(vis, 0, k[D]*sizeof(int));
  while (qs<qe) {
    int act=q[qs++], a=act;
    int sous[30];
    for (int s=0;s<D;s++) {sous[s]=a%Ds[s]; a/=Ds[s];}    
    for (int s=0;s<D;s++) for (int d=-1;d<=1;d+=2) {
      if ((sous[s]+d) < 0 || (sous[s]+d >= Ds[s])) continue;
      int nw=act+d*k[s];
      if (mem[nw]=='#' || vis[nw]) continue;
      if (nw==t) return vis[act]+1;
      vis[nw]=vis[act]+1;
      q[qe++]=nw;
    }

  }
  return -1;
}

int main(void) {
  while (scanf("%d", &D), D) {
    for (int i=0;i<D;i++) scanf("%d", Ds+i); {char c; 	while (c=getchar(), c!=EOF && c!='\n') {} }
    k[0]=1;
    for (int i=0; i<D; i++) k[i+1]=k[i]*Ds[i];
    mem=(char*)malloc(k[D]);
    vis=(int*)malloc(k[D]*sizeof(int));
    q=(int*)malloc(k[D]*sizeof(int));

    int t, s, m;
    int len=k[D]/k[2];
    for (int i=0; i<len; i++) {
      char c;
      for (int y=0; y<Ds[1]; y++) {
	for (int x=0; x<Ds[0]; x++) {
	  c=getchar();
	  if (c=='T') {t=x+k[1]*y+i*k[2]; c='.';}
	  if (c=='M') {m=x+k[1]*y+i*k[2]; c='#';}
	  if (c=='S') {s=x+k[1]*y+i*k[2]; c='.';}
	  mem[x+k[1]*y+i*k[2]]=c;
	}
	while (c=getchar(), c!=EOF && c!='\n') {}
      }
      while (c=getchar(), c!=EOF && c!='\n') {}
    }
    int len1=vlna(t, s);
    if (len1==-1) {puts("No solution. Poor Theseus!"); continue; }
    mem[m]='.';
    int len2=vlna(s, m);
    if (len2==-1) {puts("No solution. Poor Theseus!"); continue; }
    int len3=vlna(m, t);
    printf("Theseus needs %d steps.\n", len1+len2+len3);
    free(mem); free(vis); free(q);
  }
  return 0;
}