#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

int main(){
    int n; cin >> n;
    string s; cin >> s;
    VVI dp(n+1,VI(n+1,0));
    dp[0][0]=1;
    int x=0;
    REP(i,n){
        if(s[i]=='('){
            x++;
            REP(j,n){
                if(j==0)
                    dp[i+1][j]+=dp[i][j];
                else
                    dp[i+1][j]+=dp[i][j-1]+dp[i][j];
                dp[i+1][j]%=MOD;
            }
        }
        else{
            x--;
            REP(j,n){
                dp[i+1][j]+=dp[i][j+1];
                dp[i+1][j]%=MOD;
            }
            REP(j,x+1){
                dp[i+1][j]+=dp[i][j];
                dp[i+1][j]%=MOD;
            }
        }
    }
    ll ans=0;
    REP(i,n+1) ans=(ans+dp[n][i])%MOD;
    cout << ans << endl;
    return 0;
}