#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>

#define forr(a,b,c) for(int (a) = (b); (a) < (c); ++ (a))
#define fore(a,b,c) for(int (a) = (b); (a) <= (c); ++ (a))

#define pii pair<int,int>
#define int3 pair<pair<int,int>, int>
#define vi vector<int>
#define ull long long
#define vs vector<string>

//#define DEBUG

using namespace std;

bool visit[10][10];
vs v;
int area;

void dfs(int r, int c){
	if(r<0 || c<0 || r>=10 || c>=10 || visit[r][c] || v[r][c] == '.') return;
	++area; visit[r][c]=1;
	
	dfs(r+1,c);
	dfs(r-1,c);
	dfs(r,c+1);
	dfs(r,c-1);
}

int main(){
	
	#ifndef DEBUG
		freopen("DATA3.txt", "r", stdin);
		freopen("OUT3.txt", "w", stdout);
	#endif
	
	forr(_r,0,5){
		v = vs(10); string gg;
		pii a;
		
		forr(i,0,10){
			cin >> v[i];
			forr(j,0,10){
				if(v[i][j]=='A') a = make_pair(i,j);
			}
		} cin >> gg;
		
		memset(visit,0,sizeof(visit));
		area=0;
		dfs(a.first,a.second);
		
		cout << area << '\n';
	}
	
	#ifdef DEBUG
		system("pause");
	#endif
	
	return 0;
}