import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
class Cumsum1d():
    def __init__(self, A):
        self.n = len(A)
        self.Suma = [0] * (self.n + 1)
        for i in range(self.n):
            self.Suma[i + 1] += self.Suma[i] + A[i]

    def query(self, l, r):
        #0-indexed
        return self.Suma[r] - self.Suma[l]

    def get(self, i):
        return self.Suma[i + 1] - self.Suma[i]

    def __getitem__(self, p):
        if isinstance(p, int):
            return self.get(p)
        else:
            return self.query(p.start, p.stop)

s = input()

n = len(s)

d2 = pow(2, mod - 2, mod)
zero = Cumsum1d([1 if s[i] == '0' else 0 for i in range(n)])
one = Cumsum1d([1 if s[i] == '1' else 0 for i in range(n)])
wild = Cumsum1d([1 if s[i] == '?' else 0 for i in range(n)])
ans = 0
for i in range(n):
    if s[i] == '1' or s[i] == '?':
        cnt = zero[0:i] * zero[i+1:n]
        cnt += wild[0:i] * zero[i+1:n] % mod * d2
        cnt %= mod
        cnt += zero[0:i] * wild[i+1:n] % mod * d2
        cnt += wild[0:i] * wild[i+1:n] % mod * d2 % mod * d2
        cnt %= mod
        if s[i] == '?':
            cnt *= d2
        ans += cnt

print(ans * pow(2, wild[0:n], mod) % mod)