#include <stdio.h>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;

#define MAXDIM 25
#define MAX 3000000
#define mp make_pair
#define FOR(q,n) for(int q=0;q<(int)n;q++)
typedef pair<int,int> PII;

int data[MAX];
int d;
int dim[MAXDIM];
char ss[MAX];
int theseus;
int minotaur;
int sword;
queue<int> fronta;
int used[MAX];
int dsize;

void readinput(int d,int krat,int plus){
// printf("read input %d %d %d \n",d,krat,plus);
 if (d>0) {
  FOR(q,dim[d])
   readinput(d-1,krat*dim[d],krat*q+plus);
   return;
 };

 scanf("%s\n",ss);
 FOR(q,dim[0]) {
  int p=q*krat+plus;

  if (ss[q]=='T') {theseus=p;};
  if (ss[q]=='S') {sword=p;};
  if (ss[q]=='M') {minotaur=p;};
  data[p]=(ss[q]!='#');
 // printf("%d -> %d \n",p,data[p]);
//  printf("%c",ss[q]);
 }
// printf("<<-\n");
}


int init(){
 scanf("%d\n",&d);
 dsize=1;
 FOR(q,d) {scanf("%d",&dim[q]); dsize*=dim[q]; }
 FOR(q,dsize) data[q]=0;
 if (d==0) return 0;
 theseus=minotaur=sword=-1;
 readinput(d-1,1,0);
 if (theseus<0) printf("BUG\n");
 if (sword<0) printf("BUG\n");
 if (minotaur<0) printf("BUG\n");
 return 1;
}

vector<int> tovector(int pos){
vector<int> result;
//  printf("%d to vector ",pos);
for (int q=d-1;q>=0;q--) {
  result.push_back(pos % dim[q]);
  pos/=dim[q];
  }
  reverse(result.begin(),result.end());
//  FOR(q,d) printf("%d ",result[q]);
//  printf("\n");
return result;  
}

int toint(vector<int> v){
//FOR(q,d) printf("%d ",v[q]);
int res=0;
for(int q=0;q<d;q++) {
res=(res+v[q]);
if (q!=d-1) res*=dim[q+1];
//printf("medzi %d \n",res);
}
//printf("to int %d\n",res);
return res;
}

void uloz(int pos,int cnt){
if (!data[pos]) return;
if (used[pos]) return;
//printf("OK\n");
used[pos]=cnt;
fronta.push(pos);
fronta.push(cnt);
//printf("uloz %d   %d %d\n",pos,data[pos],used[pos]);

}

void try__(int pos,int cnt){
vector<int> tmp=tovector(pos);
//printf("try %d %d \n",cnt,pos);
FOR(q,d) {
 if (tmp[q]>0) {
  tmp[q]--;
  uloz(toint(tmp),cnt);
  tmp[q]++;
  }
 if (tmp[q]<dim[q]-1) {
  tmp[q]++;
  uloz(toint(tmp),cnt);
  tmp[q]--;
  }
}
}

int search(int from,int to,int &steps){
//FOR(q,dsize) printf("%d#%d\n",q,data[q]);
//printf("search %d %d \n",from,to);
while (!fronta.empty()) fronta.pop();
fronta.push(from);
fronta.push(1);
FOR(q,dsize) used[q]=0;
used[from]=1;

while (!fronta.empty() && used[to]==0) {
 int pos=fronta.front(); fronta.pop();
 int cnt=fronta.front(); fronta.pop();
 try__(pos,cnt+1);
}
steps=used[to]-1;
return used[to]!=0;
}


int solve(){
 int steps=0;
 int s;
 data[minotaur]=0;
 if (!search(theseus,sword,s)) return -1;
 steps+=s;
 data[minotaur]=1;
 if (!search(theseus,minotaur,s)) return -1;
 steps+=s;
 if (!search(sword,minotaur,s)) return -1;
 steps+=s;
 return steps;
}

int main(){
 while (init()) {
  int i=solve();
  if (i==-1) printf("No solution. Poor Theseus!\n");
   else printf("Theseus needs %d steps.\n",i);
 }
}