N = input()
l = len(N)
DP = [[[0] * 2 for _ in range(2)] for _ in range(l + 1)]

# DP[i][j][k]: i桁目まで見たときに、j:Nと一致しているか(0:一致, 1:不一致)、k:8を含むか

DP[0][0][0] = 1

MOD = 998244353

for i in range(l):
    for j in range(2):
        for k in range(2):
            for add in range(10):
                if j == 0 and add < int(N[i]):
                    DP[i + 1][1][k | (add == 8)] += DP[i][j][k]
                elif j == 0 and add == int(N[i]):
                    DP[i + 1][0][k | (add == 8)] += DP[i][j][k]
                elif j == 1:
                    DP[i + 1][1][k | (add == 8)] += DP[i][j][k]
                DP[i + 1][j][k] %= MOD
print((DP[l][0][1] + DP[l][1][1]) % MOD)