#include <iostream>
#include <queue>
#include <cstring>
using namespace std;

int map[6][6]={0};//存储地图
int path[7]={0};//存储路径
//上下左右的dx,dy
int dx[4] = {0,0,-1,+1};
int dy[4] = {+1,-1,0,0};
bool vis[32]={false};//记录是否走过


struct Point
{
    int x;
    int y;
    int id;
    Point(){
        x = y = id = 0 ;
    }
    Point(int a,int b){
        x = a;
        y = b;
        id = y + (x-1)*5;
    }
    Point(int pid){
        id = pid;
        y = id % 5;
        if(y==0 and id>0)
            y = 5;
        x = (id-1)/5 + 1 ;
    }
    //返回这个点是否在当前组成的path中
    bool isInPath(){
        for (int i = 0; i < 7; ++i)
            if(path[i]==id)
                return true;
            else if(path[i] > id)
                return false;
        return false;
    }
};

Point que[50];
//初始化输入地图
void init(){
    for (int i = 1; i <= 5; ++i)
    {
        for (int j = 1; j <= 5; ++j)
        {
            char t;
            cin>>t;
            if(t==‘J‘)
                map[i][j]=1;
        }
    }
}


//对path进行合法性判断
inline bool Check(){
    memset(vis,0,sizeof(vis));
    //bfs去检查路径
    //queue<Point> q;
    int front = 0;
    int tail = 0;
    Point start = path[0];
    //q.push(start);//把起点放入
    que[tail++] = start;

    int sum = map[start.x][start.y];
    int cur = 1;
    while(front < tail){    //如果队列非空
        Point& now = que[front];
        front++;
        vis[now.id] = true;//标志走过
        //把周围的四个点里在当前组合里的点压入队列并且累积并且标志走过
        for (int i = 0; i < 4; ++i)
        {
            Point next(now.x + dx[i],now.y + dy[i]);
            if(next.x >5 or next.x < 1 or next.y > 5 or next.y < 1)
                continue;//边界
            if(!vis[next.id] and next.isInPath()){
                vis[next.id] = true;
                cur++;
                sum += map[next.x][next.y];
                //此处可以进行剪枝
                if(7 - cur + sum < 4)
                    return false;
                que[tail++] = next;
            }
        }
    }
    return (cur==7 and sum>=4);
}
//计算
int Build(){
    int ans = 0;
    //C(25,7)枚举组合
    for(path[0]=1; path[0]<=19; path[0]++)
    for(path[1]=path[0]+1; path[1]<=20; path[1]++)
    for(path[2]=path[1]+1; path[2]<=21; path[2]++)
    for(path[3]=path[2]+1; path[3]<=22; path[3]++)
    for(path[4]=path[3]+1; path[4]<=23; path[4]++)
    for(path[5]=path[4]+1; path[5]<=24; path[5]++)
    for(path[6]=path[5]+1; path[6]<=25; path[6]++){
        ans += Check();
  //       if(Check()){
        //     for (int i = 0; i < 7; ++i)
        //     {
        //         cout<<path[i]<<" ";
        //     }cout<<endl;
        // }
    }
    return ans;
}



int main(int argc, char const *argv[])
{
    init();//初始化
    cout<<Build()<<endl;
    // path[0] = 1;
    // path[1] = 2;
    // path[2] = 3;
    // path[3] = 4;
    // path[4] = 5;
    // path[5] = 10;
    // path[6] = 15;
    // cout<<Check()<<endl;
    return 0;
}

/*
HJHJJ
HJHHJ
HJHHH
JHHHH
HHHHJ
 */
//已经生成了一个有序组合 对其进行路径判断
// if(Check()){
//     for (int i = 0; i < 7; ++i)
//     {
//         cout<<path[i]<<" ";
//     }cout<<endl;
// }