#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

ll pow_mod(ll x, ll n, ll mod){
    ll ret = 1;
    while(n > 0){
        if(n & 1) ret = (ret*x)%mod;
        x = x*x%mod;
        n >>=1;
    }
    return ret;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    string s;
    cin >> s;

    ll mod = MOD2;
    ll n = (ll)s.size();
    vector<vector<ll>> dp(n, vector<ll>(3, 0));
    ll cnt = 0;
    if(s[0]=='0'){
        dp[0][0]=1;
    }else if(s[0]=='?'){
        dp[0][0]=1;
        cnt++;
    }

    for(ll i=1; i<n; i++){
        if(s[i]=='0'){
            dp[i][0] = (dp[i-1][0]+pow_mod(2, cnt, mod))%mod;
            dp[i][1] = dp[i-1][1];
            dp[i][2] = (dp[i-1][2]+dp[i-1][1])%mod;
        }else if(s[i]=='1'){
            dp[i][0] = dp[i-1][0];
            dp[i][1] = (dp[i-1][1]+dp[i-1][0])%mod;
            dp[i][2] = dp[i-1][2];
        }else if(s[i]=='?'){
            dp[i][0] = (dp[i-1][0]+pow_mod(2, cnt, mod)+dp[i-1][0])%mod;
            dp[i][1] = (dp[i-1][1]+dp[i-1][0]+dp[i-1][1])%mod;
            dp[i][2] = (dp[i-1][2]+dp[i-1][1]+dp[i-1][2])%mod;
            cnt++;
        }
    }

    cout << dp[n-1][2] << endl;
}