#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

template<typename T>
class Cumsum{
    public:
    Cumsum(vector<T> v): v(v){
        n = v.size();
        v_cumsum = vector<T>(n+1, T(0));
        for(int i = 0; i < n; i++) v_cumsum[i+1] = v_cumsum[i]+v[i];
    }
    /**
     * v[l] + ... + v[r-1]
     */ 
    T sum(int l, int r){
        if(r <= l) return T(0);
        if(r > n) r = n;
        if(l < 0) l = 0;
        return v_cumsum[r]-v_cumsum[l];
    }
    private:
    int n;
    vector<T> v;
    vector<T> v_cumsum;
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    string s; cin >> s;
    int n = s.size();
    auto cnt = vec2d(2, n, 0);
    for(int i = 0; i < n; i++){
        char c = s[i];
        if(c == '?') cnt[0][i] = 1;
        if(c == '0') cnt[1][i] = 1;
    }
    vector<Cumsum<int>> cumsum;
    for(int i = 0; i < 2; i++) cumsum.push_back(Cumsum<int>(cnt[i]));
    int cnt_ques = cumsum[0].sum(0, n);
    mint ans = 0;
    for(int i = 1; i+1 < n; i++){
        if(s[i] == '0') continue;
        for(int j = 0; j < 2; j++){
            if(j == 0 && cumsum[0].sum(0, i) == 0) continue;
            for(int k = 0; k < 2; k++){
                if(k == 0 && cumsum[0].sum(i+1, n) == 0) continue;            
                int used_ques = (1-j)+(1-k);
                if(s[i] == '?') used_ques++;
                int rem = cnt_ques-used_ques;
                mint x = 1;
                x *= cumsum[j].sum(0, i);
                x *= cumsum[k].sum(i+1, n);
                x *= mint(2).pow(rem);
                ans += x;
            }
        }
    }
    cout << ans << endl;
}