#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define mod 998244353
long long power(long long a,long long b,long long m){
    long long p=a,Answer=1;
    for(long long i=0;i<60;i++){
        long long wari=(1LL<<i);
        if((b/wari)%2==1){
            Answer=(Answer*p)%m;
        }
        p=(p*p)%m;
    }
    return Answer;
}
long long Division(long long a,long long b,long long m){
    return (a*power(b,m-2,m))%m;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    ll N;
    string S;
    cin>>N>>S;
    if(N==2){
        cout<<2<<endl;
        return 0;
    }
    ll ruijou[500009];
    ll p=1;
    ruijou[0]=1;
    for(int i=1;i<=N;i++){
        p*=i;
        p%=mod;
        ruijou[i]=p;
    }
    if(S.at(0)=='(' && S.at(1)=='('){
        ll n=N/2;
        ll ans=0;
        for(ll i=1;i<=n;i++){
            ll wari=ruijou[i]*ruijou[n-i];
            wari%=mod;
            ll c=Division(ruijou[n],wari,mod);
            c*=c;
            c%=mod;
            ans+=c;
            ans%=mod;
        }
        ans++;
        cout<<ans<<endl;
    }
    else{
        ll n=N/2;
        ll ans=power(2,n,mod);
        cout<<ans<<endl;
    }
}