import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
n = ii()

s = input()

if n >= 300:
    raise Exception

dp = [[[0] * (2 * n) for _ in range(2 * n)] for _ in range(n + 1)]

dp[1][1][0] = dp[1][0][1] = 1
dp[1][2 * n - 2][0] = dp[1][0][2 * n - 2] = -1

for i in range(1, n):
    for j in range(n):
        for k in range(n):
            if s[i] == '(':
                dp[i + 1][j][k] += dp[i][j % (2 * n)][(k - 1) % (2 * n)] + dp[i][(j - 1) % (2 * n)][k % (2 * n)]
                dp[i + 1][j][k] %= mod
            else:
                dp[i + 1][j][k] += dp[i][j % (2 * n)][(k + 1) % (2 * n)] + dp[i][(j + 1) % (2 * n)][k % (2 * n)]
                dp[i + 1][j][k] %= mod
print(dp[n][0][0])