#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 998244353
int T,n,len[4005],minn[4005],cnt[4005],ans,dp[4005][4005];
char s[4005][4005];
signed main(){
    scanf("%lld",&T);
    while(T--){
        scanf("%lld",&n);
        memset(dp,0,sizeof(dp));
        memset(cnt,0,sizeof(cnt));
        memset(minn,0x3f,sizeof(minn));
        for(int i=1;i<=n;i++){
            scanf("%s",s[i]+1);
            len[i]=strlen(s[i]+1);
            for(int j=1;j<=len[i];j++){
                cnt[i]+=(s[i][j]=='('?1:-1);
                minn[i]=min(minn[i],cnt[i]);
            }
        }
        ans=dp[0][0]=1;
        for(int i=1;i<=n;i++){
            for(int j=max({-minn[i],-cnt[i],0LL});j+max(0LL,cnt[i])<=4000;j++)
                dp[i][j+cnt[i]]=dp[i-1][j];
            ans=(ans+dp[i][0])%mod,dp[i][0]=(dp[i][0]+dp[i-1][0])%mod;
            for(int j=1;j<=4000;j++)
                dp[i][j]=(dp[i][j]+dp[i-1][j])%mod;
        }
        printf("%lld\n",ans);
    }
    return 0;
}