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

public class F
{
  
  public F() throws IOException
  {    
    Scanner in = new Scanner(new File("DATA4.txt")); 
    PrintWriter out = new PrintWriter(new FileWriter("OUT4.txt"));
    for (int i = 0; i < 5; i++ )
    {
      String forest[] = new String[11];
      char f[][] = new char[11][10];
      int t = 0;
      
      boolean tree = true;
      for(int j = 0; j < 11; j++ )
      {
        forest[j] = in.next();
      }
      for (int k = 0; k < 10; k++ )
      {
        for (int l = 0; l < 10; l++ )
        {
          f[k][l] = forest[k].charAt(l);
        }
      }
      
      for (int k = 0; k < 11; k++ )
      {
        for (int l = 0; l < 10; l++ )
        {
          f[k][l] = forest[k].charAt(l);
        }
      }
      while(tree)
      {
        int numTree = 0;
        int numFire = 0;
        t++;
        int x1 =10;
        int y1 = 0;
        int x2 =10;
        int y2 = 0;
        int x3 =10;
        int y3 = 0;
        int x4 =10;
        int y4 = 0;
        for (int k = 0; k < 10; k++ )
        {
          for (int l = 0; l < 10; l++ )
          {
            if ((f[k][l] == 'F')&&(k != x1)&&(l != y1)&&(k != x2)&&(l != y2)&&(k != x3)&&(l != y3)&&(k != x4)&&(l != y4))
            {
              numFire++;
              if ((k > 0) || (k < f.length) ||(l > 0) || (l < f[k].length))
              {
                for (int m = 0; m < 4; m++ )
                {
                  if (f[k + 1][l] == 'T')
                  {
                    f[k + 1][l] = 'F';
                    x1 = (k + 1);
                    y1 = l;                  
                  }
                  else if (f[k - 1][l] == 'T')
                  {
                    f[k - 1][l] = 'F';
                    x2 = (k - 1);
                    y2 = l;
                    numTree--;
                  }
                  else if (f[k][l + 1] == 'T')
                  {
                    f[k][l + 1] = 'F';
                    x3 = k;
                    y3 = (l + 1);
                  }
                  else if (f[k][l - 1] == 'T')
                  {
                    f[k][l - 1] = 'F'; 
                    x4 = k;
                    y4 = (l - 1);
                    numTree--;
                  }              
                  else
                  {
                    f[k][l] = '.';  
                    
                  }
                }
              }            
            }
            else if (f[k][l] == 'T')
            {
              numTree++;
            }
          }
        }
        if ((numTree != 0)&&(numFire == 0))
        {
          tree = false;
          t = -1;
        }
        else if ((numTree == 0)&&(numFire != 0))
        {
          tree = false;
          t = t - 1;
        }
        else
        {}
      }
      out.println(t);
    }
    in.close(); 
    out.close();  
  }
  
  public static void main(String args[]) throws IOException
  {
    new F();
  }
}