#include <bits/stdc++.h>
#define int long long
#define rep(i, l, r) for (int i (l); i <= (r); ++ i)
#define rrp(i, l, r) for (int i (r); i >= (l); -- i)
#define eb emplace_back
using namespace std;
#define pii pair <int, int>
#define inf 1000000000
#define ls (p << 1)
#define rs (ls | 1)
constexpr int N = 2e5 + 5, M = 1e6, P = 998244353, B = 400;
typedef long long ll;
typedef unsigned long long ull;
inline int rd () {
  int x = 0, f = 1;
  char ch = getchar ();
  while (! isdigit (ch)) {
    if (ch == '-') f = -1;
    ch = getchar ();
  }
  while (isdigit (ch)) {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar ();
  }
  return x * f;
}
int qpow (int x, int y) {
  int ret (1);
  for (; y; y >>= 1, x = x * x % P) if (y & 1) ret = ret * x % P;
  return ret;
}
int n, fac[N], ifac[N];
char s[N];
int c0, c1;
int C (int n, int m) {
  if (m > n || m < 0) return 0;
  return fac[n] * ifac[m] % P * ifac[n - m] % P;
}
int32_t main () {
  // freopen ("1.in", "r", stdin);
  // freopen ("1.out", "w", stdout);
  scanf ("%s", s + 1);
  n = strlen (s + 1);
  fac[0] = 1;
  rep (i, 1, n) fac[i] = fac[i - 1] * i % P;
  ifac[n] = qpow (fac[n], P - 2);
  rrp (i, 1, n) ifac[i - 1] = ifac[i] * i % P;
  rep (i, 1, n) if (i & 1) {
    if (s[i] == '0') s[i] = '1'; else if (s[i] == '1') s[i] = '0';
  }
  rep (i, 1, n) c0 += s[i] == '0', c1 += s[i] == '1';
  int cnt (0), all (0);
  rep (i, 1, n) {
    if ((i & 1) && s[i] == '?') ++ cnt;
    if (s[i] == '?') ++ all;
  }
  int ans (0);
  rep (i, 0, cnt) {
    int k = c1 + 2 * i - c0 + all - 2 * cnt;
    if (k & 1) continue;
    int j = k / 2;
    (ans += C (cnt, i) * C (all - cnt, j)) %= P;
  } cout << ans;
}