n=input()
M=998244353
m=len(n)
dp=[[[0]*2 for _ in range(2)]for _ in range(m+1)]
dp[0][0][0]=1
for i in range(1,m+1):
  c=int(n[i-1])
  for j in range(2):
    for k in range(2):
      for l in range(10):
        if c<l and j<1:
          continue
        j2=1 if l<c else j
        k2=1 if l==8 else k
        dp[i][j2][k2]+=dp[i-1][j][k]
        dp[i][j2][k2]%=M
ans=dp[m][0][1]+dp[m][1][1]
print(ans%M)