#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s; cin >> s;
	int n = s.size();
	vector<int>c0(n + 1), c1(n + 1), c2(n + 1);
	rep(i, n) {
		if ('0' == s[i])c0[i + 1]++;
		if ('1' == s[i])c1[i + 1]++;
		if ('?' == s[i])c2[i + 1]++;
	}
	rep(i, n)c0[i + 1] += c0[i];
	rep(i, n)c1[i + 1] += c1[i];
	rep(i, n)c2[i + 1] += c2[i];
	mint ans = 0;
	rep(i, n) {
		if ('0' == s[i])continue;
		//[0,i),i,[i+1,n);
		int l0 = c0[i] - c0[0];
		int r0 = c0[n] - c0[i + 1];
		int l2 = c2[i] - c2[0];
		int r2 = c2[n] - c2[i + 1];
		//0?
		if (l2 + r2 >= 1)ans += (mint)l0 * r2 * pow_mod(2, l2 + r2 - 1, mod);
		//??
		if (l2 + r2 >= 2)ans += (mint)l2 * r2 * pow_mod(2, l2 + r2 - 2, mod);
		//?0
		if (l2 + r2 >= 1)ans += (mint)l2 * r0 * pow_mod(2, l2 + r2 - 1, mod);
		//00
		if (l2 + r2 >= 0)ans += (mint)l0 * r0 * pow_mod(2, l2 + r2, mod);
	}
	cout << ans.val() << endl;
	return 0;
}