N = input()
mod = 998244353
ng = 8
dp1 = [[0] * (len(N) + 1) for _ in range(10)]
dp2 = [[0] * (len(N) + 1) for _ in range(10)]
dp1[0][0] = 1
pn = 0
for i, c in enumerate(N):
    n = int(c)
    # 同じ
    if n != ng:
        dp1[n][i + 1] = dp1[pn][i]
    # 同じ⇒未満
    for k in range(n):
        if k == ng:
            continue
        dp2[k][i + 1] += dp1[pn][i]
        dp2[k][i + 1] %= mod
    # 未満⇒未満
    for j in range(10):
        if j == ng:
            continue
        for k in range(10):
            if k == ng:
                continue
            dp2[k][i + 1] += dp2[j][i]
            dp2[k][i + 1] %= mod
    pn = n
ans = 1
p = 1
for i, c in enumerate(N[::-1]):
    ans += p * int(c) % mod
    p = p * 10 % mod
    ans %= mod
for j in range(10):
    ans -= dp1[j][len(N)]
    ans -= dp2[j][len(N)]
    ans %= mod
print(ans)