#include<vector>
#include<iostream>
#include<string>
#include<set>
#include<sstream>
#include<map>
#include<deque>
#define pb(a) push_back(a)
using namespace std;
vector<int> velk;
vector<int> curv;
char p[1100000];
int hashuj(vector<int> v)
{
  int res=0,nas=1; 
  for (int i=velk.size()-1;i>=0;i--)
    res+=v[i]*nas,
    nas*=velk[i];              
  return res;    
}
int t,s,m;
bool seen[1100000];
void nacit(int ind)
{
  if (ind==velk.size())
  {
    char c='\n';
    while (c=='\n')
      c=getchar();    
    int hashed=hashuj(curv);  
    if (c=='T')
      t=hashed;
    if (c=='M')
      m=hashed;
    if (c=='S')
      s=hashed;                  
    p[hashed]=c;
  }else 
    for (int i=0;i<velk[ind];i++)    
    {
      curv[ind]=i;
      nacit(ind+1);          
    }
}
int d[2]={-1,1};
vector<int> dehash(int h)
{
  vector<int> res;
//  cout<<h<<" dehashed : ";
  for (int i=velk.size()-1;i>=0;i--)
    res.pb(h%velk[i]),
    h/=velk[i];//,cout<<res.back()<<" ";
  reverse(res.begin(),res.end());    
//  cout<<endl;    
  return res;     
}
int main()
{

  int dim;
  while (cin>>dim,dim)
  {    
//    cout<<"dim " <<dim<<endl;
    velk.clear();
    curv.clear();
    int cis;
    for (int i=0;i<dim;i++)
      cin>>cis,
      velk.push_back(cis),curv.push_back(0);      
    reverse(velk.begin(),velk.end());  
//    cout<<velk.size()<<" "<<curv.size()<<endl;  
    nacit(0);  
                
  //t->s
  deque<pair<int,int> > f;
  f.push_back(make_pair(0,t));
  memset(seen,0,sizeof(seen));
  int cesta=-1;
  while (f.size()>0)
  {
    pair<int,int> top=f.front();
    f.pop_front();
    if (seen[top.second]||p[top.second]=='#'||p[top.second]=='M')
      continue;
    seen[top.second]=1;
    if (top.second==s)
    {  
      cesta=top.first;
      break;
    } 
    vector<int> curSur=dehash(top.second); 
    for (int i=0;i<curSur.size();i++)
      for (int j=0;j<2;j++)
      {
        curSur[i]+=d[j];
        if (curSur[i]>=0&&curSur[i]<velk[i])        
          f.push_back(make_pair(top.first+1,hashuj(curSur)));        
        curSur[i]-=d[j];
      }
  }
  if (cesta==-1)
  {
//    cout<<cesta<<endl;
    cout<<"No solution. Poor Theseus!"<<endl;
    continue;
  }
  memset(seen,0,sizeof(seen));
  int cesta2=-1;
  f.clear();
  f.push_back(make_pair(0,s));
  while (f.size()>0)
  {
    pair<int,int> top=f.front();
    f.pop_front();
    if (seen[top.second]||p[top.second]=='#')
      continue;
    seen[top.second]=1;
    if (top.second==m)
    {  
      cesta2=top.first;
      break;
    } 
    vector<int> curSur=dehash(top.second); 
/*    cout<<top.first<<" ";
    for (int i=0;i<curSur.size();i++)
      cout<<curSur[i]<<" ";
    cout<<endl;  */
    for (int i=0;i<curSur.size();i++)
      for (int j=0;j<2;j++)
      {
        curSur[i]+=d[j];
        if (curSur[i]>=0&&curSur[i]<velk[i])        
          f.push_back(make_pair(top.first+1,hashuj(curSur)));        
        curSur[i]-=d[j];
      }
  }
  if (cesta2==-1)
  {
    cout<<"No solution. Poor Theseus!"<<endl;
    continue;
  }
  memset(seen,0,sizeof(seen));
  int cesta3=-1;
  f.clear();
  f.push_back(make_pair(0,m));
  while (f.size()>0)
  {
    pair<int,int> top=f.front();
    f.pop_front();
    if (seen[top.second]||p[top.second]=='#')
      continue;
    seen[top.second]=1;
    if (top.second==t)
    {  
      cesta3=top.first;
      break;
    } 
    vector<int> curSur=dehash(top.second); 
    for (int i=0;i<curSur.size();i++)
      for (int j=0;j<2;j++)
      {
        curSur[i]+=d[j];
        if (curSur[i]>=0&&curSur[i]<velk[i])        
          f.push_back(make_pair(top.first+1,hashuj(curSur)));        
        curSur[i]-=d[j];
      }
  }
  if (cesta3==-1)
  {
    cout<<"No solution. Poor Theseus!"<<endl;
    continue;
  }
//  cout<<cesta<<" "<<cesta2<<endl;
  cout<<"Theseus needs "<<cesta+cesta2+cesta3<<" steps."<<endl;
  }
  return 0;
}