#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int main()
{
    freopen("DATA4.txt", "r", stdin);
    freopen("OUT4.txt", "w", stdout);
    for (int l0 = 0; l0 < 5; l0++)
    {
        char a[20][20] = {};
        queue<pair<int, int> > q;
        int tree = 0;
        for (int l1 = 1; l1 <= 10; l1++)
        {
            for (int l2 = 1; l2 <= 10; l2++)
            {
                cin >> a[l1][l2];
                if (a[l1][l2] == 'F') q.push(make_pair(l1,l2));
                else if (a[l1][l2] == 'T') tree++;
            }
            cin.ignore(255,'\n');
        }
        cin.ignore(255, '\n');
        int cnt = 0;
        int p = q.size();
        if (tree > 0)
        while (q.size() > 0)
        {
            int x = q.front().first, y = q.front().second;
            q.pop();
            for (int l1 = -1; l1 < 2; l1++)
            {
                if (tree == 0) break;
                for (int l2 = -1; l2 < 2; l2++)
                {
                    if (abs(l1 + l2) == 1)
                        if (a[x + l1][y + l2] == 'T')
                        {
                            q.push(make_pair(x + l1,y + l2));
                            a[x + l1][y + l2] = 'F';
                            tree--;
                        }
                    if (tree == 0) break;
                }
            }
            p--;
            if ((p == 0) || (tree == 0))
            {
                cnt++;
                p = q.size();
            }
            if (tree == 0) break;
        }
        if (tree == 0) cout << cnt << '\n';
        else cout << -1 << '\n';
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}