#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline void addmod(int &x){ if(x >= mod) x -= mod; }
inline void addmod(ll &x){ if(x >= mod) x -= mod; }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
inline ll INV(ll x){ return qpow(x, mod-2); };
int n; char s[6005];
int dp[6005][3005][2];
inline int ok(char ch){ return ch=='('?1:-1;}
void procedure(){
	n=read();
	scanf("%s", s);
	dp[0][0][0] = 1;
	for(int i=0;i<2*n;i++)
		for(int j=0;j<=n;j++)
			for(auto o: {0,1}){
				if(!dp[i][j][o]) continue;
				if(j+ok(s[i])>=0) addmod(dp[i+1][j+ok(s[i])][o] += dp[i][j][o]); // do not choose
				if(j) addmod(dp[i+1][j-1][1] += dp[i][j][o]);
				if(!o) addmod(dp[i+1][j+1][0] += dp[i][j][o]);
			}
	printf("%d\n", (dp[2*n][0][0]+dp[2*n][0][1])%mod);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	// math_init();
	// NTT::init();
	while(T--) procedure();
	return 0;
}