#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

const ll modc = 998244353;

int main(){

    ll N, cnt=0, k;
    string S;
    cin >> N >> S;

    vector<vector<ll>> dp(N, vector<ll>(N));
    dp[0][0] = 1;

    for (int i=0; i<N; i++){
        vector<vector<ll>> pd(N, vector<ll>(N));
        if (S[i] == '('){
            cnt++;
            for (int j=0; j<=cnt; j++){
                k = cnt-j;
                if (j) pd[j][k] += dp[j-1][k];
                if (k) pd[j][k] += dp[j][k-1];
                pd[j][k] %= modc;
            }
        }
        else{
            cnt--;
            for (int j=0; j<=cnt; j++){
                k = cnt-j;
                if (j+1<N) pd[j][k] += dp[j+1][k];
                if (k+1<N) pd[j][k] += dp[j][k+1];
                pd[j][k] %= modc;
            }
        }
        swap(dp, pd);
    }

    cout << dp[0][0] << endl;

    return 0;
}