/*
[templates]: 
duipai
spjdp
compre
addhis
floor_sum
treedfs
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(time(0)); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N = 4000, mod = 998244353; 
int mn[N + 10], tot[N + 10]; int dp[N + 10][N + 10]; 
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int T; cin >> T;
    while(T--) {
        int n; cin >> n; int ssi = 0; 
        f(i, 1, n) {
            string s; cin >> s; ssi += s.size(); 
            int tmp = 0, stk = 0; 
            for(char ch : s) {
                if(ch == '(') stk ++; 
                else stk --; 
                cmin(tmp, stk); 
            }
            mn[i] = tmp; tot[i] = stk; 
        }
        f(i, 0, n) f(j, 0, ssi) dp[i][j] = 0; 
        dp[0][0] = 1; 
        f(i, 1, n) {
            f(j, 0, ssi) {
                dp[i][j] += dp[i - 1][j]; //不选 i
                if(dp[i][j] >= mod) dp[i][j] -= mod; 
                if(j + mn[i] >= 0) {
                    dp[i][j + tot[i]] += dp[i - 1][j]; //选 i
                    if(dp[i][j + tot[i]] >= mod) dp[i][j + tot[i]] -= mod; 
                }
            }
        }
        cout << dp[n][0] << endl; 
    }

    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}