# correct

P = 998244353

def inv(x: int) -> int:
    """Return the modular inverse of x."""
    return pow(x, P - 2, P)

N_digits = list(map(int, reversed(input())))
L = len(N_digits)

def nth_pow(x: int) -> int:
    """Return x^N mod P."""
    res = 1
    for d in N_digits:
        if d:
            res = res * x % P
        x = x * x % P
    return res

ans = 0

# --- 1 ---
N = 0
for d in reversed(N_digits):
    N = (2 * N + d) % P
ans += 2 * N * nth_pow(3) % P * inv(3) % P

# --- 0 ---
pow_r_doubling = 3 * inv(2) % P
pow_2 = 1
ans_0 = 0
for d in N_digits:
    if d == 0:
        ans_0 = (ans_0 + pow_2) % P
    else:
        ans_0 = (ans_0 * pow_r_doubling) % P
    pow_r_doubling = pow_r_doubling * pow_r_doubling % P
    pow_2 = pow_2 * 2 % P
ans += ans_0 * nth_pow(2) * 4 % P * inv(9) % P

print(ans % P)