#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--)
using namespace std;
using ll = long long;
using ld = long double;
const double pi = 3.141592653589793;
const long long inf = 2 * 1e9;
const long long linf = 4 * 1e18;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

// atcoder
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

vector<pair<ll, ll>> base = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

int main()
{

    //////////////////
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    //////////////////

    ll N;
    cin >> N;
    string S;
    cin >> S;
    if (S.at(1)=='(') {
        mint2 ans = 0;
        vector<mint2> kai(1010101);
        kai.at(0) = 1;
        rep(i, 1, 1000000)
        {
            kai.at(i) = kai.at(i-1) * i;
        }
        rep(i, 0, N / 2 + 1)
        {
            mint2 temp = kai.at(N / 2);
            temp /= kai.at(i);
            temp /= kai.at(N / 2 - i);
            temp *= temp;
            ans += temp;
        }
        cout << ans.val();
    }
    else {
        mint2 ans = 1;
        rep(i, 0, N/2) {
            ans *= 2;
        }
        cout << ans.val();
    }
}