import java.io.*;
import java.util.*;

public class dwite4 {

	/**
	 * @param args
	 * @throws IOException
	 */


	
	public static void main(String[] args) throws FileNotFoundException,
			IOException {
		BufferedReader in = new BufferedReader(new FileReader("DATA4.txt"));
		PrintWriter out = new PrintWriter(new FileWriter("OUT4.txt"));
		for (int t = 0; t < 5; t++) {

			char m1[][] = new char[10][10];
			char m2[][] = new char[10][10];
			for(int i=0;i<10;i++)
			{
				m1[i] = in.readLine().toCharArray();
			}
			in.readLine();
			
			int count = 0;
			while (true)
			{
				count ++;
				boolean fireSpread = false;
				
				for (int i = 0; i < 10; i++)
				{
					for (int j = 0; j < 10; j++)
						m2[i][j] = m1[i][j];
				}
				
				///////
				
				for (int i =0; i < 10; i++)
				{
					for (int j = 0; j<10; j++)
					{
						if (m1[i][j] == 'F')
						{
							// up
							if (i > 0)
							{
								if (m1[i-1][j] == 'T')
								{
									m2[i-1][j] = 'F';
									fireSpread = true;
								}
							}
							// down
							if (i< 9)
							{
								if (m1[i+1][j] == 'T')
								{
									m2[i+1][j] = 'F';
									fireSpread = true;
								}
							}
							// left
							if (j > 0)
							{
								if (m1[i][j-1] == 'T')
								{
									m2[i][j-1] = 'F';
									fireSpread = true;
								}
							}
							// right
							if (j < 9)
							{
								if (m1[i][j+1] == 'T')
								{
									m2[i][j+1] = 'F';
									fireSpread = true;
								}
							}
						}
					}
				}
				
				boolean treesLeft = false;
				for (int i = 0; i < 10; i++)
				{
					for (int j = 0; j < 10; j++)
					{
						if (m2[i][j] == 'T')
						{
							treesLeft = true;
							break;
						}
					}
				}
				
				if (treesLeft == false)
				{
					if (fireSpread)
						out.println(count);
					else
						out.println(0);
					break;
				}
				else
				{
					if (fireSpread == false)
					{
						out.println(-1);
						break;
					}
					else
					{
						for (int i = 0; i < 10; i++)
						{
							for (int j = 0; j < 10; j++)
							{
								m1[i][j] = m2[i][j];
							}
						}
					}
				}
			}
			
		}
		out.close();

	}
}