#include <iostream>
#include <algorithm>
#include <vector>
#include <atcoder/all>

#define ALL(V) std::begin(V), std::end(V)

using modint = atcoder::modint998244353;

const int SIZE = 2e5 + 10;
modint dp[SIZE][3];
modint pow2[SIZE];

const int Z = 0;
const int ZO = 1;
const int ZOZ = 2;

int main() {
    pow2[0] = 1;
    for (int i = 1; i < SIZE; i++) pow2[i] = pow2[i - 1] * 2;

    std::string S;
    std::cin >> S;

    const int N = S.size();

    int cnt_q = 0;
    for (int i = 0; i < N; i++) {
        const char c = S[i];
        dp[i + 1][Z] = dp[i][Z];
        dp[i + 1][ZO] = dp[i][ZO];
        dp[i + 1][ZOZ] = dp[i][ZOZ];
        if (c == '?') {
            dp[i + 1][Z] *= 2;
            dp[i + 1][ZO] *= 2;
            dp[i + 1][ZOZ] *= 2;
        }
        if (c == '0' || c == '?') {
            dp[i + 1][Z] += pow2[cnt_q];
            dp[i + 1][ZOZ] += dp[i][ZO];
        }
        if (c == '1' || c == '?') {
            dp[i + 1][ZO] += dp[i][Z];
        }
        cnt_q += (c == '?');
    }

    std::cout << dp[N][ZOZ].val() << std::endl;
    return 0;
}