#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <ctime>

using namespace std;

char grid [10][10];

bool kill(int y, int x){
    bool result = 0;
    if(y!=0){
        if(grid[y-1][x]=='T'){
            grid[y-1][x]='F';
            result=1;
            }
        }

    if(y!=9){
        if(grid[y+1][x]=='T'){
            grid[y+1][x]='F';
            result=1;
            }
        }

        if(x!=0){
        if(grid[y][x-1]=='T'){
            grid[y][x-1]='F';
            result=1;
            }
        }

        if(x!=9){
        if(grid[y][x+1]=='T'){
            grid[y][x+1]='F';
            result=1;
            }
        }
    return result;
}

bool recurse (){
    bool result = 0;
    vector<pair<int,int> > coord;
    for(int i = 0;i<10;i++){
        for(int j = 0;j<10;j++){
            if(grid[i][j]=='F'){
                coord.push_back(make_pair(i,j));
            }
            //cerr<<grid[i][j];
        }
        //cerr<<endl;
    }
    for(int i= 0;i<coord.size();i++){
        if(kill(coord[i].first,coord[i].second))result=1;
    }
    return result;

}

bool done(){
    for(int i= 0;i<10;i++){
        for(int j =0;j<10;j++){
            if(grid[i][j]=='T') return false;
        }
    }
    return true;
}

int main ()
{
    #ifndef DEBUG
        freopen ("DATA4.txt","r",stdin);
        freopen ("OUT4.txt","w",stdout);
    #endif

    for (int _t=0;_t<5;_t++){
        string line;
        for(int i = 0;i<10;i++){
            getline(cin,line);
            for(int j = 0;j<10;j++){
                grid[i][j]=line[j];
            }
        }
        getline(cin,line);

        int time = 0;
        while(recurse()){
            time++;
        }

        if(done()){ cout<<time;}
        else cout<<-1;

        cout<<endl;
    }

    return 0;
}