#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")


#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>

template<typename T> void debug(T e){
    cerr << e << endl;
}

template<typename T> void debug(vector<T> &v){
    rep(i, v.size()){
        cerr << v[i] << " ";
    }
    cerr << endl;
}

template<typename T> void debug(vector<vector<T>> &v){
    rep(i, v.size()){
        rep(j, v[i].size()){
            cerr << v[i][j] << " ";
        }
        cerr << endl;
    }
}

template<typename T> void debug(vector<pair<T, T>> &v){
    rep(i,v.size()){
        cerr << v[i].first << " " << v[i].second << endl;
    }
}

template<typename T> void debug(set<T> &st){
    for (auto itr = st.begin(); itr != st.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(multiset<T> &ms){
    for (auto itr = ms.begin(); itr != ms.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(map<T, T> &mp){
    for (auto itr = mp.begin(); itr != mp.end(); itr++){
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out(){
    cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
    cerr << H << " ";
    debug_out(T...);
}


int main(){
    string S;
    cin >> S;
    ll N = S.size();
    
    vl pow_2(N + 1, 0);
    pow_2[0] = 1;
    for (ll i = 0; i < N; i++){
        pow_2[i + 1] = (pow_2[i] * 2LL) % mod2;
    }

    ll rem = 0;
    rep(i,N){
        if (S[i] == '?') rem++;
    }
    ll left_hatena = 0;
    ll right_hatena = rem;
    vl left_0(N, 0);
    vl right_0(N, 0);
    if (S[0] == '0') left_0[0] = 1;
    if (S[N - 1] == '0') right_0[0] = 1;
    for (ll i = 1; i < N; i++){
        if (S[i] == '0') left_0[i] = left_0[i - 1] + 1;
        else left_0[i] = left_0[i - 1];
    }
    for (ll i = N - 1; i >= 0; i--){
        if (S[i] == '0') right_0[i] = right_0[i + 1] + 1;
        else right_0[i] = right_0[i + 1];
    }
    ll ans = 0;
    for (ll i = 0; i < N; i++){
        if (S[i] == '?') right_hatena--;
        if (S[i] == '1' || S[i] == '?'){
            //固定の0のみ使う場合
            ll count1 = (left_0[i] * right_0[i]) % mod2;
            count1 = (count1 * pow_2[left_hatena + right_hatena]) % mod2;
            ans = (ans + count1) % mod2;

            //片方ははてなを使う場合
            ll count2 = (left_0[i] * right_hatena + right_0[i] * left_hatena) % mod2;
            if (count2 > 0){
                count2 = (count2 * pow_2[left_hatena + right_hatena - 1]) % mod2;
            }
            ans = (ans + count2) % mod2;

            //両方はてなを使う場合
            ll count3 = (left_hatena * right_hatena) % mod2;
            if (count3 > 0){
                count3 = (count3 * pow_2[left_hatena + right_hatena - 2]) % mod2;
            }
            ans = (ans + count3) % mod2;
        }
        if (S[i] == '?') left_hatena++;
        //debug_out(left_hatena, right_hatena);
    }
    cout << ans << endl;
}