#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s; cin >> s;
	if (0 != s.size() % 2) {
		cout << 0 << endl;
		return 0;
	}
	int n = s.size() / 2;
	vector dp0(s.size() + 1, vector<mint>(s.size() + 1));//[
	vector dp1(s.size() + 1, vector<mint>(s.size() + 1));//]
	dp0[0][0] = 1;
	rep(i, s.size()) {
		//todo ng 遷移
		if (('(' == s[i]) || ('.' == s[i])) {
			rep(j, n) {
				if (i - j < 0)continue;
				if ((j + 1) < (i - j))continue;
				dp0[j + 1][i - j] += dp0[j][i - j];
				dp1[j + 1][i - j] += dp1[j][i - j];
			}
		}
		if ((')' == s[i]) || ('.' == s[i])) {
			rep(j, n) {
				if (i - j < 0)continue;
				if ((i - j) < (j + 1))continue;
				dp0[i - j][j + 1] += dp0[i - j][j];
				dp1[i - j][j + 1] += dp1[i - j][j];
			}
		}
		if (('?' == s[i]) || ('.' == s[i])) {
			rep(j, n) {//[
				if (i - j < 0)continue;
				if ((j + 1) < (i - j))continue;
				dp0[j + 1][i - j] += dp0[j][i - j];
			}
			rep(j, n) {//]
				if (i - j < 0)continue;
				if ((i - j) < (j + 1))continue;
				dp1[i - j][j + 1] += dp0[i - j][j];
				dp1[i - j][j + 1] += dp1[i - j][j];
			}
		}
	}
	mint ans = dp0[n][n] + dp1[n][n];
	cout << ans.val() << endl;
	return 0;
}