#include<bits/extc++.h>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using Mint = modint998244353;
using mint = modint;
#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 rep2(i, a, b) for (int i = (int)a; i < (int)(b); ++i)
#define rrep2(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); --i)
constexpr unsigned half = 499122177;

int main(){
    cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    string S;
    cin >> S;
    int N = S.length();
    int A[N];
    int sum[3] = {0,0,0};
    rep(i, N){
        A[i] = S[i] == '?' ? 2 : S[i] - '0';
        ++sum[A[i]];
    }
    Mint answer{0};
    int left[3] = {0,0,0};
    int right[3];
    Mint two[N+1];
    two[0] = 1;
    rep(i, N) two[i+1] = two[i]*2;
    rep(i, N){
        if(A[i] != 0){
            rep(j, 3) right[j] = sum[j] - left[j];
            --right[A[i]];
            answer += (Mint::raw(left[0]) + Mint::raw(left[2])*half)*(Mint::raw(right[0]) + Mint::raw(right[2])*half)*two[left[2] + right[2]];
        }
        ++left[A[i]];
    }
    cout << answer.val() << '\n';
    return 0;
}