#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  vector<array<mint, 2>> dp(n + 1);
  dp[0][0] = 1;
  for(char c: s) {
    vector<array<mint, 2>> ndp(n + 1);
    if (c == '(' || c == '.') {
      rep(i, n) rep(j, 2) if (mint v = dp[i][j]; v.val()) {
        ndp[i+1][j] += v;
      }
    }
    if (c == ')' || c == '.') {
      rep(i, n) if (i) rep(j, 2) if (mint v = dp[i][j]; v.val()) {
        ndp[i-1][j] += v;
      }
    }
    if (c == '?' || c == '.') {
      rep(i, n) if (mint v = dp[i][0]; v.val()) {
        ndp[i+1][0] += v;
      }
      rep(i, n) if (i) rep(j, 2) if (mint v = dp[i][j]; v.val()) {
        ndp[i-1][1] += v;
      }
    }
    swap(dp, ndp);
  }
  mint ans = dp[0][0] + dp[0][1];
  cout << ans.val() << '\n';
}