#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using vl = vector <ll>;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e5 + 11;
ll pre[2][N], suf[2][N];

int main() {
	ios::sync_with_stdio(0);
	string s; cin >> s;
	int n = s.size();
	s = '#' + s;
	int q = count(s.begin(), s.end(), '?');
	
	for(int i = 1; i <= n; i ++) {
		pre[0][i] = pre[0][i - 1] + (s[i] == '0');
		pre[1][i] = pre[1][i - 1] + (s[i] == '?');
	}
	for(int i = n; i >= 1; i --) {
		suf[0][i] = suf[0][i + 1] + (s[i] == '0');
		suf[1][i] = suf[1][i + 1] + (s[i] == '?');
	}
	
	ll ans = 0;
	for(int i = 1; i <= n; i ++)
		if(s[i] != '0') {
			int u = (s[i] == '?');
			for(int x : {0, 1})
				for(int y : {0, 1}) if(u + x + y <= q) {
					ans += pre[x][i - 1] * suf[y][i + 1] % mod * qpow(2, q - u - x - y);
					ans %= mod;
				}
		}
	
	cout << ans << '\n';
}