#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

char s[];

int map[][];

int dx[]={-,,,};

int dy[]={,,,-};

void dfs(int x1,int y1,int pos1,int x2,int y2,int pos2,int tot){

    if(x1==x2&&y1==y2){ cout<<tot;exit(); }

    if(tot>){ cout<<"";exit(); }

    int cx1,cy1,cx2,cy2;

    cx1=x1+dx[pos1];cy1=y1+dy[pos1];

    cx2=x2+dx[pos2];cy2=y2+dy[pos2];

    if(cx1<||cx1>||cy1<||cy1>||map[cx1][cy1]){

        pos1+=;pos1%=;

        cx1=x1;cy1=y1;

    }

    if(cx2<||cx2>||cy2<||cy2>||map[cx2][cy2]){

        pos2+=;pos2%=;

        cx2=x2;cy2=y2;

    }

    dfs(cx1,cy1,pos1,cx2,cy2,pos2,tot+);

}

int main(){

    int sx,sy,tx,ty;

    for(int i=;i<=;i++){

        scanf("%s",s);

        for(int j=;j<=;j++){

            if(s[j-]=='*')    map[i][j]=;

            else if(s[j-]=='.')    map[i][j]=;

            else if(s[j-]=='C'){ sx=i;sy=j; }

            else if(s[j-]=='F'){

                tx=i;ty=j;

            }

        }

    }

    dfs(sx,sy,,tx,ty,,);

}