#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int maxn = 2001000;
const int mod = 998244353;
long long fac[maxn], invfac[maxn];
pair<long long, long long> cnt[maxn], rcnt[maxn];
inline long long C(int a, int b) {
  if (b > a) return 0;
  return fac[a] * invfac[a - b] % mod * invfac[b] % mod;
}
string orig;
inline long long GetInv(int a) { return invfac[a] * fac[a - 1] % mod; }
inline pair<long long, long long> Get(int a, int b, int more) {
  if (more < 0) return Get(b, a, -more);
  if (a < more) return make_pair(0, 0);
  long long cnt = C(a + b, b + more);
  long long sum =
      C(a + b, b + more) * (b + more) % mod * GetInv(a + b) % mod * a % mod;
  return make_pair(cnt, sum);
}
int main() {
  ios_base::sync_with_stdio(0);
  fac[0] = invfac[0] = 1;
  for (int i = 1; i < maxn; i++) fac[i] = fac[i - 1] * i % mod;
  invfac[maxn - 1] = pow(fac[maxn - 1], mod - 2, mod);
  for (int i = maxn - 2; i > 0; i--) invfac[i] = invfac[i + 1] * (i + 1) % mod;
  cin >> orig;
  int n = orig.length();
  for (int i = 0; i < n; i++) {
    if (orig[i] == '?')
      cnt[i].second++;
    else if (orig[i] == '(')
      cnt[i].first++;
    if (i) {
      cnt[i].first += cnt[i - 1].first;
      cnt[i].second += cnt[i - 1].second;
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    if (orig[i] == '?')
      rcnt[i].second++;
    else if (orig[i] == ')')
      rcnt[i].first++;
    rcnt[i].first += rcnt[i + 1].first;
    rcnt[i].second += rcnt[i + 1].second;
  }
  long long ans = 0;
  for (int i = 0; i < n - 1; i++) {
    auto p = Get(cnt[i].second, rcnt[i + 1].second,
                 -cnt[i].first + rcnt[i + 1].first);
    ans += min(cnt[i].first, rcnt[i + 1].first) * p.first + p.second;
    ans %= mod;
  }
  cout << (ans + mod) % mod << endl;
  return 0;
}
