#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
using namespace std;

char c[1<<21];
int n[20], d;
int kod(vector<int> &a) {
	int res = 0;
	for (int i=d-1; i>=0; i--) {
		res *= n[i];
		res += a[i];
	}
	return res;
}
char ee[1<<21];
bool bol[1<<21];
int vz[1<<20];
vector<int> moc;
int T, M, S;
void nacitaj(int d, int zac) {
	if (d>=2) for (int i=0; i<n[d]; i++)
		nacitaj(d-1, zac+moc[d]*i);
	else {
		for (int i=0; i<n[1]; i++) {
			scanf("%s", ee);
			for (int j=0; j<n[0]; j++) {
				c[zac] = ee[j];
				if (c[zac] == 'T' || c[zac] == 'S' || c[zac] == 'M') {
					if (c[zac] == 'T')
						T = zac;
					if (c[zac] == 'S')
						S = zac;
					if (c[zac] == 'M')
						M = zac;
				}
				zac++;
			}
		}
	}
}
int prehladaj(int zac, int kon) {
	queue<int> q;
	vz[zac] = 0; bol[zac] = true;
	for (q.push(zac); !q.empty(); q.pop()) {
		int o = q.front();
		if (o == kon) return vz[o];
		for (int i=0; i<d; i++) {
			int sur = (o/moc[i])%n[i], tmp;
			for (int j=-1; j<2; j++) if (j!=0) {
				tmp = sur+j;
				if (tmp < 0 || tmp>=n[i]) continue;
				int y = o+j*moc[i];
				if (c[y] == '#') continue;
				if (!bol[y]) {
					q.push(y);
					bol[y] = true;
					vz[y] = vz[o] + 1;
				}
			}
		}
	}
	return -1;
}
int main() {
	while (scanf("%d", &d) == 1) {
		if (!d) break;

		moc.assign(d+1, 1);
		for (int i=0; i<d; i++) {
			scanf("%d", &n[i]);
			moc[i+1] = moc[i]*n[i];
		}
		nacitaj(d-1, 0);

		int kol = moc[d];
		for (int i=0; i<kol; i++)
			bol[i] = false;
		bol[M] = true;
		int co = prehladaj(T, S);
		bool ok = true;
		if (co == -1) ok = false;
		else {
			for (int i=0; i<kol; i++)
				bol[i] = false;
			int r = prehladaj(S, M);
			for (int i=0; i<kol; i++)
				bol[i] = false;
			if (r == -1) ok = false;
			else co += r+prehladaj(M, T);
		}
		if (ok) printf("Theseus needs %d steps.\n", co);
		else printf("No solution. Poor Theseus!\n");
	}
}