MOD = 998244353
def solve(S):
    N = len(S)
    dp = [[0,0] for _ in range(N)]
    inc8 = 0
    for i in range(N):
        if i > 0:
            dp[i][0] = (dp[i-1][0] * 9) % MOD
            dp[i][1] = (dp[i-1][0] + dp[i-1][1] * 10) % MOD
        s = int(S[i])
        if inc8 == 0:
            if s == 9:
                dp[i][0] += 8
                dp[i][1] += 1
            else:
                dp[i][0] += s
        else:
            dp[i][1] += s
        if s == 8:
            inc8 = 1
        if i == N-1 and inc8 == 1:
            dp[i][1] += 1
        dp[i][0] %= MOD
        dp[i][0] %= MOD
    return dp[-1][1]

print(solve(input()))