import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
n = input()
mod = 998244353

def solve(n):
    dp = [1, 0]
    for i in range(len(n)):
        ndp = [0, 0]
        dp, ndp = ndp, dp
        for j in range(2):
            for x in range(10):
                if x == 8:
                    continue
                ni = i + 1
                nj = j
                if j == 0 and int(n[i]) < x:
                    continue
                if int(n[i]) > x:
                    nj = 1
                dp[nj] += ndp[j]
                dp[nj] %= mod
    return sum(dp) % mod

ans = 0
t = 1

	
for i in range(len(n)-1, -1, -1):
    ans += int(n[i]) * t
    ans %= mod
    t = t * 10 % mod

# print(ans)
print((ans-solve(n) + 1) % mod)