//#include <cmath>
#include <cstdio>
//#include <cstring>
//#include <iostream>
//#include <algorithm>
//#define LL  long long
//#define INF 1000000007
//------------------------------------------------------------
//struct P{};
//------------------------------------------------------------
//void Max(int &num1,int num2) { if (num1<num2) num1=num2; }
//void Min(int &num1,int num2) { if (num1>num2) num1=num2; }
//int  Min(int  num1,int num2) { return num1<num2? num1 :num2;}
//------------------------------------------------------------
int  tcase;
int  icase;

int  n;
int  i,j,k;
char tab[600][600];
char c1[600][600];
char c2[600][600];

int  N,O;
int  f[2][600][600];

int  ans;
//------------------------------------------------------------
int  main( )
{
    for (scanf("%d",&tcase); ++icase<=tcase;)
    {
        //--0 init
        scanf("%d",&n);
        ans=0;
        N=O=0;
        for (i=0; i<=n+1; i++)
        for (j=0; j<=n+1; j++) f[0][i][j]=f[1][i][j]=0;
        
        //--1 read && init
        for (i=0; i<=n+1; i++) tab[n+1][i]=tab[0][i]=' ';
        for (i=0; i<=n+1; i++) tab[i][0]=tab[i][n+1]=' ';
        for (i=1; i<=n; i++)
        {
            scanf("\n");
            for (j=1; j<=n; j++) tab[i][j]=getchar(); 
        }
        //--2 
        for (i=1; i<=n; i++)
        {
            for (j=1; j<=n-i; j++) c1[i+j-1][j]=tab[i][j];
            c1[i+j-1][j]=tab[i][j];
            //i=n+1-j j=n+1-i
            for (j; j<=n  ; j++) c2[2*n+2-i-j-1][n+1-i]=tab[i][j];
        }
        
        if (c1[1][1]==c2[1][1])
            f[0][1][1]=1;
        for (i=2; i<=n; i++)
        {
            N=1-N;
            O=1-N;
            for (j=1; j<=i; j++)
            for (k=1; k<=i; k++) f[N][j][k]=0;
            for (j=1; j<=i; j++)
            {
                for (k=1; k<=i; k++) if (c1[i][j]==c2[i][k])
                {
                    if (i>1)
                    if (c1[i-1][j  ] == c2[i-1][k])
                        f[N][j][k  ] += f[O][j][k];
                    if (i>1&&k>1)
                    if (c1[i-1][j  ] == c2[i-1][k-1])
                        f[N][j][k  ] += f[O][j][k-1];
                    if (i>1&&j>1)
                    if (c1[i-1][j-1] == c2[i-1][k])
                        f[N][j][k  ] += f[O][j-1][k];
                    if (i>1&&j>1&&k>1)
                    if (c1[i-1][j-1] == c2[i-1][k-1])
                        f[N][j][k  ] += f[O][j-1][k-1];
                    f[N][j][k]%=5201314;
                }
            }
        }
        
        for (i=1; i<=n; i++) ans=(ans+f[N][i][i])%5201314;
        printf("%d\n",ans);
/*        for (i=1; i<=n; i++,printf("\n"))
        for (j=1; j<=n; j++) printf("%c ",c1[i][j]);
        for (i=1; i<=n; i++,printf("\n"))
        for (j=1; j<=n; j++) printf("%c ",c2[i][j]);
*/        /*for (i=1; i< n; i++)
        {
            for (j=1; j<=i; j++)
            {
                dx1=i+1-j;
                dy1=j;
                
                for (k=1; k<=i; k++)
                {
                    dx2=n+1-k;
                    dy2=n+k-i;
                    if (tab[dx1][dy1]==tab[dx2][dy2])
                    {
                        if (tab[dx-1][dy1]==tab[dx][])
                    }
                }
            }
            f[i][]
        }*/
    }
}