#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

const ll mod = 998244353;

ll mpow(ll a, ll x){
  ll res = 1;
  while(x > 0){
    if(x & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    x >>= 1;
  }
  return res;
}

int main(){
  string S; cin >> S;
  int N = sz(S);
  vector<ll> Z(N+1,0);
  rep(i,N) Z[i+1] = Z[i] + (S[i]=='0');
  vector<ll> Q(N+1,0);
  rep(i,N) Q[i+1] = Q[i] + (S[i]=='?');
  ll ans = 0;
  rep(i,N){
    if(S[i]!='0'){
      ll lz = Z[i];
      ll rz = Z[N]-Z[i+1];
      ll lq = Q[i];
      ll rq = Q[N]-Q[i+1];
      ll ad = 0;
      ad += lz*rz%mod*mpow(2,Q[N]-(S[i]=='?'))%mod;
      ad += lq*rz%mod*mpow(2,Q[N]-(S[i]=='?')-1)%mod;
      ad += lz*rq%mod*mpow(2,Q[N]-(S[i]=='?')-1)%mod;
      ad += lq*rq%mod*mpow(2,Q[N]-(S[i]=='?')-2)%mod;
      ans += ad % mod;
    }
  }
  cout << ans%mod << endl;
  return 0;
}