import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
s = input()
n = len(s)
mod = 998244353
lc = [0] * (1+n)
rc = [0] * (1+n)
for i in range(n):
    if s[i] == "0":
        lc[i+1] += lc[i] + 1
    else:
        lc[i+1] = lc[i]
s = s[::-1]
for i in range(n):
    if s[i] == "0":
        rc[i+1] += rc[i] + 1
    else:
        rc[i+1] = rc[i]
s = s[::-1]
ld = [0] * (1+n)
rd = [0] * (1+n)
for i in range(n):
    if s[i] == "?":
        ld[i+1] += ld[i] + 1
    else:
        ld[i+1] = ld[i]
s = s[::-1]
for i in range(n):
    if s[i] == "?":
        rd[i+1] += rd[i] + 1
    else:
        rd[i+1] = rd[i]
s = s[::-1]

ans = 0
x = s.count("?")
for i in range(n):
    if s[i] == "1":
        ans += lc[i] * rc[n-1-i] * pow(2, x, mod)
        ans += ld[i] * rc[n-1-i] * pow(2, x-1, mod)
        ans += lc[i] * rd[n-1-i] * pow(2, x-1, mod)
        ans += ld[i] * rd[n-1-i] * pow(2, x-2, mod)
    if s[i] == "?":
        ans += lc[i] * rc[n-1-i] * pow(2, x-1, mod)
        ans += ld[i] * rc[n-1-i] * pow(2, x-2, mod)
        ans += lc[i] * rd[n-1-i] * pow(2, x-2, mod)
        ans += ld[i] * rd[n-1-i] * pow(2, x-3, mod)
    ans %= mod
print(ans)