import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;


public class Solution3 {
	static boolean[][] map = new boolean[10][10];
	static boolean[][] done = new boolean[10][10];
	static int startx;
	static int starty;
	static int num;
	public static void main(String[] args)throws  Exception {
		BufferedReader r = new BufferedReader(new FileReader("DATA3.txt"));
		PrintWriter p = new PrintWriter(new FileWriter("OUT3.txt"));

		for(int i = 0 ; i < 5; i++){
			num = 0;
			for(int  j = 0 ;  j < 10 ; j++){
				String input = r.readLine();
				for(int k = 0 ; k < 10 ; k++){
					done[k][j] = false;
					if(input.charAt(k ) == '#'){
						map[k][j] = true;
					}else if(input.charAt(k) == 'A'){
						map[k][j] = true;
						startx = k;
						starty = j;
					}else{
						map[k][j] = false;
					}
				}
			}
			r.readLine();
			recurse(startx,starty);
			p.println(num);
		}
		p.close();
	}

	public static void recurse(int x, int y){
		if( x == 10 || x == -1 || y == 10 || y == -1){
			return;
		}
		if(!map[x][y] || done[x][y]){
			return;
		}
		done[x][y] = true;
		num++;
		//System.out.println(num);
		recurse(x+1,y);
		recurse(x-1,y);
		recurse(x,y+1);
		recurse(x,y-1);
	}

}