MOD = 998244353
S = input()
N = len(S)
fact = [1]*(N+1)
rfact = [1]*(N+1)
r = 1
for i in range(1, N+1):
    fact[i] = r = r * i % MOD
rfact[N] = r = pow(fact[N], -1, MOD)
for i in range(N, 0, -1):
    rfact[i-1] = r = r * i % MOD

def comb(n, k):
    return fact[n] * rfact[k] * rfact[n-k] % MOD

X = []
now = 1
p = 10
for k in range(N):
    X.append(now)
    now = (10 * p - 9 * (p - now)) % MOD
    p = (p * 10) % MOD

ans = 0
st = 0
for i,s in enumerate(S):
    k = N - i - 1
    s = int(s)
    if st == 0:
        if k == 0:
            if s >= 8:
                ans += 1
        else:
            if s <= 8:
                ans += s * X[k-1]
                ans %= MOD
            if s == 8:
                st = 1
                ans += 1
            if s == 9:
                ans += 8 * X[k]
                ans += pow(10,k,MOD)
                ans %= MOD
    else:

        ans += s * pow(10,k,MOD)
        ans %= MOD

print(ans)