#include<bits/stdc++.h>
#define il inline
#define int long long
namespace things{
	il int rd(){
		int f = 1, x = 0;
		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;
	}
	il void wt(int x){
		if (x < 0){
			putchar('-');
			wt(-x);
			return ;
		}
		if (x > 9) wt(x / 10);
		putchar(x % 10 + '0');
	}
	il int max(int x, int y){
		return std::max(x, y);
	}
	il int min(int a, int b){
		return std::min(a, b);
	}
}
using namespace things;
using namespace std;

const int p = 998244535, N = 2005;
int id, n, ans, cnt1, cnt2, x, y, z, res, m, k, q;
string s;
int a[N], sum[N], fac[N];

void init(){
	fac[0] = 1;
	for (int i = 1; i < N; i++) fac[i] = (fac[i - 1] << 1) % p;
}

signed main(){
	id = rd();
	cin >> s;
	n = s.size();
	init();
	for (int i = 1; i <= n; i++){
		if (s[i - 1] == '(') a[i] = 1;
	}
	for (int i = 1; i <= n; i++){
		if (a[i] == 1){
			for (int j = n; j >= 1; j--){
				sum[j] = (sum[j] + sum[j - 1]) % p;
			}
			sum[1] = (sum[1] + fac[i - 1]) % p;
		}
		else{
			ans = (ans + sum[1] * fac[n - i]) % p;
			for (int j = 0; j < n; j++){
				sum[j] = (sum[j] + sum[j + 1]) % p;
			}
		}
	}
	cout << ans % p;
	return 0;
}