int a,b,c,pre;

int num;

struct h_node *next;

int h = 0;

if(b<=c){

for(int i=b; i<=c; i++){

h = (h<<4) + d[a][i];

unsigned long g = h&0Xf0000000L;

if (g) h^= g>>24;

h&=~g;

}

}else{

for(int i=b; i>=c; i--){

h = (h<<4) + d[a][i];

unsigned long g = h&0Xf0000000L;

if (g) h^= g>>24;

h&=~g;

}

}

return h % M;

if(b1-a1!=c2-b2){

return false;

}

for(int i=b1,p=b2; i<=c1; i++,p++){

if(d[a1][i]!=d[a2][i]){

return false;

}

}

return true;

int re = 0;

if(h_table[h] == NULL){

node *n = new node();

n->a = a,n->b=b, n->c=c;

n->num = 1;

n->pre = row;

n->next = NULL;

h_table[h] = n;

re = 1;

}else{

bool exist = false;

node* t = h_table[h];

while(t!=NULL){

if(match(d,a,b,c,t->a, t->b, t->c) && t->pre!=row){

t->num++;

exist = true;

re = t->num;

t->pre = row;

break;

}

t = t->next;

}

if(exist==false){

node *n = new node();

n->a = a,n->b=b, n->c=c;

n->num = 1;

n->pre = row;

n->next = h_table[h];

h_table[h] = n;

re = 1;

}

}

return re;

int h1 = get_hash(d,a,b,c);

int r1 = insert(d,a,b,c,h1);

return r1;

for(int i=0; i<M; i++)h_table[i] = NULL;

ans = 0;

for(int i=0; i<N; i++){

row = i;

int sz = strlen(d[i]);

for(int j=0; j<sz; j++){

for(int k=j; k<sz; k++){

int num = look_up(d,i,j,k);

if(i==N-1 && num==N){

if(k-j+1>ans){

ans = k-j+1;

}

}

}

}

for(int j=0; j<sz; j++){

for(int k=j; k<sz; k++){

int num = look_up(r_d,i,j,k);

if(i==N-1 && num==N){

if(k-j+1>ans){

ans = k-j+1;

}

}

}

}

}

cout<<ans<<endl;

scanf("%d",&T);

while(T--){

scanf("%d",&N);

for(int i=0; i<N; i++){

scanf("%s",d[i]);

int sz = strlen(d[i]);

int p1 = 0, p2 = sz-1;

while(p1<sz){

r_d[i][p1] = d[i][p2];

p2--, p1++;

}

}

for(int i=0; i<N; i++){

cout<<r_d[i]<<endl;

}

work();

}

return 0;