#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
//using mint = modint1000000007;
using mint = modint998244353;


map<pair<int,int>,mint> dp[3005];

int main(){
  int N;
  cin >> N;
  string S;
  cin >> S;
  
  dp[0][make_pair(0,0)] = 1;
  rep(i,N){
    FOR(it,dp[i]){
      mint x = it->second;
      int j = (it->first).first;
      int k = (it->first).second;
      if(S[i] == '('){
        if(j+1<105) dp[i+1][make_pair(j+1,k)] += x;
        if(k+1<105) dp[i+1][make_pair(j,k+1)] += x;
      }
      if(S[i] == ')'){
        if(j-1>=0) dp[i+1][make_pair(j-1,k)] += x;
        if(k-1>=0) dp[i+1][make_pair(j,k-1)] += x;
      }
    }
  }

  cout << dp[N][make_pair(0,0)].val() << endl;
  
  return 0;
}