1 #include<cstdio>
 2 #include<cstring>
 3 #include<queue>
 4 using namespace std;
 5 char map[17][17];//地图
 6 bool visit[17][17];//用来记录状态
 7 int dir[][2]={{1,0},{0,1},{-1,0},{0,-1}};//方向
 8 struct Point
 9 {   //记录点的坐标和步数
10     int x,y,cnt;
11 };
12 void BFS(int sx,int sy)
13 {
14     queue<Point> a;
15     Point now,next;
16     now.x = sx; now.y = sy; now.cnt = 0;
17     a.push(now);
18     visit[sx][sy] = 1;
19     while(!a.empty())
20     {
21         Point temp = a.front(); a.pop();
22         if(map[temp.x][temp.y] == 'E')
23         {
24             printf("%d\n",temp.cnt);
25             return ;
26         }
27         for(int i = 0; i < 4; i++)
28         {
29             next.x = temp.x+dir[i][0];
30             next.y = temp.y+dir[i][1];
31             next.cnt = temp.cnt+1;
32             if((!visit[next.x][next.y]) && (map[next.x][next.y]!='*'))
33             {   a.push(next); visit[next.x][next.y] = 1;}
34         }
35     }
36     return ;
37 }
38 int main(void)
39 {
40     int i,j,t,m,n;
41     scanf("%d",&t);
42     while(t--)
43     {
44         int sx,sy;
45         memset(visit,0,sizeof(visit));
46         scanf("%d",&n);
47         for(i = 1; i <= n; i++)
48             scanf("%s",&map[i][1]);
49         for(i = 0; i <= (n+1); i++)
50             for(j = 0; j <= (n+1); j++)
51             {
52                 if(map[i][j] == 'S')
53                     sx = i, sy = j;
54                 if((i==0) || (j==0) || (i==n+1) || (j==n+1))
55                     map[i][j] = '*';
56             }
57         BFS(sx,sy);
58     }
59
60     return 0;
61 }