#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
mint dp[202020][2],dp0[202020][2],dp01[202020][2],dp010[202020][2];
string s;
int n;

void solve(){
	n = s.size();
	ll cnt = 0;
	for(int i =0;i<n;i++){
		if(s[i]=='0'){
			dp0[i+1][0] += dp0[i][0]+dp0[i][1]+mint(2).pow(cnt);
		}else if(s[i]=='1'){
			dp0[i+1][1] += dp0[i][0]+dp0[i][1];
		}else{
			dp0[i+1][0] += dp0[i][0]+dp0[i][1]+mint(2).pow(cnt);
			dp0[i+1][1] += dp0[i][0]+dp0[i][1];
			cnt++;
		}
	}
	for(int i = 0;i<n;i++){
		if(s[i]=='0'){
			dp01[i+1][0] += dp01[i][0] + dp01[i][1];
		}else if(s[i]=='1'){
			dp01[i+1][1] += dp01[i][0] + dp01[i][1] + dp0[i][0]+dp0[i][1];
		}else{
			dp01[i+1][0] += dp01[i][0] + dp01[i][1];
			dp01[i+1][1] += dp01[i][0] + dp01[i][1] + dp0[i][0]+dp0[i][1];
		}
	}
	for(int i = 0;i<n;i++){
		if(s[i]=='0'){
			dp010[i+1][0] += dp010[i][0] + dp010[i][1]+dp01[i][0]+dp01[i][1];
		}else if(s[i]=='1'){
			dp010[i+1][1] += dp010[i][0] + dp010[i][1];
		}else{
			dp010[i+1][0] += dp010[i][0] + dp010[i][1]+dp01[i][0]+dp01[i][1];
			dp010[i+1][1] += dp010[i][0] + dp010[i][1];
		}
	}
	mint ans = dp010[n][0] + dp010[n][1];
	//cout<<dp0[n][0].val()<<endl;
	//cout<<dp01[n][0].val()<<endl;
	//cout<<dp010[n][0].val()<<endl;
	cout<<ans.val()<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> s;
	solve();
}