N = 10**6
mod = 998244353
fac = [1]*(N+1)
finv = [1]*(N+1)
for i in range(N):
    fac[i+1] = fac[i] * (i+1) % mod
finv[-1] = pow(fac[-1], mod-2, mod)
for i in reversed(range(N)):
    finv[i] = finv[i+1] * (i+1) % mod

def cmb1(n, r, mod):
    if r <0 or r > n:
        return 0
    r = min(r, n-r)
    return fac[n] * finv[r] * finv[n-r] % mod

table = [0]*N
table[0] = 1
for i in range(1, N):
    table[i] = table[i-1]*11
    table[i] %= mod

s = str(input())
n = len(s)
ans = 0
for i, c in enumerate(s):
    ans += int(c)*table[n-1-i]*(1<<i)
    ans %= mod
print(ans)