#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200005, mod = 998244353;
int n, s0, s1;
string s;
int fac[maxn], ifac[maxn];
int power(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod; b >>= 1;
    }
    return res;
}
void init() {
    fac[0] = ifac[0] = 1;
    for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod, ifac[i] = ifac[i - 1] * power(i, mod - 2) % mod;
}
int C(int n, int m) {return fac[n] * ifac[m] % mod * ifac[n - m] % mod;}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> s; n = s.size(); s = " " + s;
    init();
    if (n % 2) {cout << 0 << '\n'; return 0;}
    for (int i = 1; i <= n; i++) {
        if ((i & 1) && s[i] != '?') s[i] ^= 1;
        if (s[i] == '0') s0++;
        if (s[i] == '1') s1++;
    }
    if (s0 > n / 2 || s1 > n / 2) {cout << 0 << '\n'; return 0;}
    cout << C(n - s0 - s1, n / 2 - s0) << '\n';
    return 0;
}