#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } mint dp[3003][3003]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; string s; cin >> s; //vector> dp(n + 1, vector(n)); dp[0][0] = 1; int c = 0; rep(i, n) { rep(j, c + 1) { int k = c - j; if ('(' == s[i]) { dp[i + 1][j + 1] += dp[i][j]; dp[i + 1][j + 0] += dp[i][j]; } else { if (j)dp[i + 1][j - 1] += dp[i][j]; if (k)dp[i + 1][j + 0] += dp[i][j]; } } if ('(' == s[i])c++; else c--; } cout << dp[n][0].val() << endl; return 0; }