class CP:
    def __init__(self, N):
        self.fact = [1]
        self.fact_inv = [1]
        for i in range(1, N+1):
            self.fact.append((self.fact[-1]*i)%MOD)
            self.fact_inv.append(pow(self.fact[-1], -1, MOD))
    def C(self, N, K):
        if N >= K:
            return self.fact[N]*self.fact_inv[K]%MOD*self.fact_inv[N-K]%MOD
        else:
            return 0
    def P(self, N, K):
        if N >= K:
            return self.fact[N]*self.fact_inv[N-K]%MOD
        else:
            return 0

N = int(input())
S = input()

MOD = 998244353

cp = CP(N)
if S[:2] == "()":
    print(pow(2, N//2, MOD))
else:
    ans = 0
    for i in range(N//2+1):
        ans += cp.C(N//2, i)**2
        ans %= MOD
    print(ans)