#include <bits/stdc++.h>
#define ll long long
#define sc(x) scanf("%lld", &(x))
#define sf(x) printf("%lld", (x))
#define mod 100000007
using namespace std;
char dis[12][12];
ll total=0,n,flag=0;
bool isPrime(int num)
{
    if (num == 2 || num == 3)
        return true;
    if (num % 6 != 1 && num % 6 != 5)
        return false;
    int tmp = sqrt(num);
    for (int i = 5; i <= tmp; i += 6)
        if (num % i == 0 || num % (i + 2) == 0)
            return false;
    return true;
}
void dfs(ll x,ll y){
  if(x==n&&y==n){
    dis[n][n]='.';
    total++;
    flag=1;
    return;
  }
  if(y+1<=n&&dis[x][y+1]!='#'){
    dis[x][y+1]='#';
    dfs(x,y+1);
    if(flag&&(x>1||y>1))return;
    dis[x][y+1]='.';
  }
  if(x+1<=n&&dis[x+1][y]!='#'){
    dis[x+1][y]='#';
    dfs(x+1,y);
    if(flag&&(x>1||y>1))return;
    dis[x+1][y]='.';
  }
  flag=0;
  return;
}
int main()
{
  ll t;
  sc(t);
  while (t--)
  {
    total=0;
    sc(n);
    getchar();
    for(ll i=1;i<=n;i++){
      for(ll j=1;j<=n;j++){
        dis[i][j]=getchar();
      }
      getchar();
    }
    if(dis[1][1]=='#'||dis[n][n]=='#'){
      cout<<0;
    }else 
    {
      dfs(1,1);
      cout<<total;
    }
    cout << endl;
  }
}