#include <stdio.h>
#include <strings.h>
#include <string.h>
#include <stdlib.h>

typedef unsigned int uint;

unsigned int map[1050000];


unsigned int d;
unsigned int size[20];
unsigned int ps[20];

uint tpos[20];
uint spos[20];
uint mpos[20];

uint *stack;

uint supersize;

void recalc()
{
	unsigned int t;

	ps[0] = 1;
	for (t=1;t<d;t++)
	{
		ps[t] = ps[t-1]*size[t-1];
	/*	prunsigned intf("ps[%i] = %i\n",t, ps[t]);*/
	}
	supersize = ps[d-1] * size[0];
}

unsigned int pindex(unsigned int *p)
{
	unsigned int t;
	unsigned int sum = p[0];
	for (t=1;t<d;t++) {
		sum += p[t]*ps[t];	
	}
	return sum;
}

void set(unsigned int *p, unsigned int v)
{
	map[pindex(p)] = v;
}

unsigned int get(unsigned int *p)
{
	return map[pindex(p)];
}

void sizes()
{
	unsigned int t;
	for (t=0;t<d;t++) {
		scanf("%i",&size[t]);
	/*	prunsigned intf("size[%i] = %i\n",t,size[t]);*/
	}
	/*scanf("\n");*/
}
void printv(uint *v)
{
	int t;
	for (t=0;t<d;t++) 
	{
		printf("%i:", v[t]);
	}
	printf("\n");
}

void readmap2d(unsigned int *v, unsigned int sx, unsigned int sy) {
	unsigned int s,t;
	for (t=0;t<sy;t++) {
		for (s=0;s<sx;s++) {
			/*p[s][t] = getchar();*/
			v[0] = s;
			v[1] = t;
			int c = getchar();
			set(v, c);
			if (c == 'T') {
				memcpy(tpos, v, sizeof(int) * d);
			}
			if (c == 'S') {
				memcpy(spos, v, sizeof(int) * d);
			}
			if (c == 'M') {
				memcpy(mpos, v, sizeof(int) * d);
			}

		}
		getchar();
	}
	getchar();
}

void readmap(unsigned int *v, unsigned int dim)
{
	if (dim == 2) {
		readmap2d(v, size[0], size[1]);
		return;
	};

	unsigned int t;
	for(t=0;t<size[dim-1];t++) 
	{
		v[dim-1] = t;
		readmap(v, dim - 1);
	}
}

void veccpy(unsigned int *des, unsigned int *src)
{
	memcpy(des, src, d*sizeof(int));
}

int search(unsigned int *start, char target)
{
	int t;
	for (t=0;t<supersize;t++) {
		if (map[t] == '*') 
			map[t] = '.';
	}
	set(start, '*');
	/*uint stack[105000][20];*/
	int len[1050000];
	int spos = 1;
	int head = 0;
	veccpy(stack, start);
	len[0] = 0;
	while(spos != head) {
	/*	int a[d];
		veccpy(a,stack[head]);*/
		uint *a = &stack[head*20];

		int l = len[head];

		head++;
	/*	if (get(a) == target)
			return l;*/
		l++;
		int dim;
		for (dim=0;dim<d;dim++) {
	/*		veccpy(stack[spos],a);
			int h = stack[spos][dim];*/
			a[dim]++;

			if (a[dim] < size[dim]) {
				char val = get(a);
				if (val == target) {
					return l;
				}
				if (val == '.') {
					set(a, '*');
					veccpy(&stack[spos*20],a);
					len[spos] = l;
					spos++;
				}
			}

			if (a[dim] > 1) {

				a[dim]-=2;
				char val = get(a);
				if (val == target) {
					return l;
				}

				if (val == '.') {
					set(a, '*');
					veccpy(&stack[spos*20],a);
					len[spos] = l;
					spos++;
				}
				a[dim]++;
			} else {
				a[dim]--;
			}
		}
	}

	return -1;
}

void go()
{

	sizes();
	recalc();

	getchar();

	unsigned int p[d];
	readmap(p, d);

	p[0] = 0;
	p[1] = 0;

	/*unsigned int z; 
	for (z = 0; z < 9; z++) {
		printf("%c",map[z]);
	}

	unsigned int s,t;
	for (s=0;s<3;s++) 
	 for (t=0;t<3;t++) {
	 	unsigned int v[d];
		v[0] = s;
		v[1] = t;
		v[2] = 0;
		printf("%i %i : %u\n", s,t, pindex(v));
	 }*/

	int vzd = 0, xx;
	xx = search(tpos, 'S');
	if (xx == -1) { printf("No solution. Poor Theseus!\n"); return; };
	vzd += xx;	

	xx = search(spos, 'M');
	if (xx == -1) { printf("No solution. Poor Theseus!\n"); return; };
	vzd += xx;	

	set(tpos, 'T');

	xx = search(mpos, 'T');
	if (xx == -1) { printf("No solution. Poor Theseus!\n"); return; };
	vzd += xx;	
	printf("Theseus needs %i steps.\n", vzd);

}

int main()
{
	stack = malloc(sizeof(uint) * 20 * 1050000);
	for(;;) {
		scanf("%i\n",&d);
		if (d == 0)
			return 0;
		go();
	}
	return 0;
}