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

public class Question4
{
  public static char s[][][]=new char[10][10][5];
  public static int s1[][][]=new int[10][10][5];
  public static int ans[]={0,0,0,0,0};
  public static int nunber=5;

  public static void main(String[] args)throws Exception 
  {
     Scanner myscan=new Scanner(System.in);
     //System.out.println("start");
     
     
     
     
     
     FileReader fin=new FileReader("DATA4.txt");
     Scanner sc=new Scanner(fin);
     for(int i=0; i<nunber; i++){
       for(int j=0; j<10; j++){
         String x=sc.nextLine();
         for(int k=0; k<10; k++){
           s[k][j][i]=x.charAt(k);
           if(x.charAt(k)=='F')
             s1[k][j][i]=0;
           if(x.charAt(k)=='T')
             s1[k][j][i]=99999;
           if(x.charAt(k)=='.')
             s1[k][j][i]=-1;
         }
       }
       sc.nextLine();
     }
     fin.close();
    
     for(int i=0; i<nunber; i++){
       for(int j=0; j<10; j++){
         for(int k=0; k<10; k++){
           if(s[k][j][i]=='F'){
             expand(k, j, i);
           }
         }
         
       }
     
     }
     
     
     for(int i=0; i<nunber; i++){
       int c=0;
       for(int j=0; j<10; j++){
         for(int k=0; k<10; k++){
           if(s1[k][j][i]>c){
             c=s1[k][j][i];
           }
         }  
       }
       ans[i]=c;
     }
       
       
       
     for(int i=0; i<nunber; i++){
       for(int j=0; j<10; j++){
         for(int k=0; k<10; k++){
           if(s1[k][j][i]==99999){
             ans[i]=-1;
           }
         }  
       }
     }
     
     
          
     FileWriter fw = new FileWriter("OUT4.txt");
     for(int i=0; i<nunber; i++){
       fw.write(ans[i]+"\r\n");}

     fw.close();
   //  System.out.print("finish");
  

    
    
   }
  public static void expand(int x, int y, int n){
    if(y>0){
      if(s1[x][y-1][n] !=-1 && s1[x][y-1][n]>=s1[x][y][n]+1){
        s1[x][y-1][n]=s1[x][y][n]+1;
        if(ans[n]<s1[x][y][n]+1)
          ans[n]=s1[x][y][n]+1;
        expand(x, y-1, n);
      }
    }
    if(y<9){
      if(s1[x][y+1][n] !=-1 && s1[x][y+1][n]>=s1[x][y][n]+1){
        s1[x][y+1][n]=s1[x][y][n]+1;
        if(ans[n]<s1[x][y][n]+1)
          ans[n]=s1[x][y][n]+1;
        expand(x, y+1, n);
      }
    }
    if(x<9){
      if(s1[x+1][y][n] !=-1 && s1[x+1][y][n]>=s1[x][y][n]+1){
        s1[x+1][y][n]=s1[x][y][n]+1;
        if(ans[n]<s1[x][y][n]+1)
          ans[n]=s1[x][y][n]+1;
        expand(x+1, y, n);
      }
    }
    if(x>0){
      if(s1[x-1][y][n] !=-1 && s1[x-1][y][n]>=s1[x][y][n]+1){
        s1[x-1][y][n]=s1[x][y][n]+1;
        if(ans[n]<s1[x][y][n]+1)
          ans[n]=s1[x][y][n]+1;
        expand(x-1, y, n);
      }
    }
    
  }
    
  
}