//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const int mod=998244353;
void upd(int &a,int b)
{
	a+=b;
	if(a>=mod) a-=mod;
}
int n;
int f[6060][3030],g[6060][3030];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	string s;
	cin>>s;
	f[0][0]=1;
	for(int i=0;i<n+n;i++)
		for(int j=0;j<=n;j++)
		{
			int d=(s[i]=='(')?(1):(-1);
			if(j+d>=0)
			{
				upd(f[i+1][j+d],f[i][j]);
				upd(g[i+1][j+d],g[i][j]);
			}
			upd(f[i+1][j+1],f[i][j]);
			if(j-1>=0)
			{
				upd(g[i+1][j-1],f[i][j]);
				upd(g[i+1][j-1],g[i][j]);
			}
		}
	int ans=0;
	upd(ans,f[n+n][0]);
	upd(ans,g[n+n][0]);
	int ok=1,c=0;
	for(auto ch:s)
	{
		if(ch=='(') c++;
		else c--;
		if(c<0) ok=0;
	}
	ans-=ok;
	if(ans<0) ans+=mod;
	cout<<ans<<'\n';
	return 0;
}