import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
1000
98765432109876543210
"""

def input():
  return sys.stdin.readline()[:-1]

mod=998244353
def solve(test):
  N=input()
  def idx(i,j):
    return i*6+j
  dp=[0]*(len(N)+1)*6
  dp[idx(0,5)]=1
  for i in range(len(N)):
    dp[idx(i+1,0)]+=dp[idx(i,0)]+dp[idx(i,2)]
    dp[idx(i+1,0)]%=mod
    dp[idx(i+1,1)]+=dp[idx(i,0)]
    dp[idx(i+1,1)]%=mod
    dp[idx(i+1,2)]+=dp[idx(i,0)]*8+dp[idx(i,1)]*9+dp[idx(i,2)]*9
    dp[idx(i+1,2)]%=mod
    if N[i]=='4':
      dp[idx(i+1,3)]+=dp[idx(i,3)]+dp[idx(i,5)]
      dp[idx(i+1,3)]%=mod
      dp[idx(i+1,2)]+=(dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)])*3
      dp[idx(i+1,2)]%=mod
      dp[idx(i+1,1)]+=dp[idx(i,3)]
      dp[idx(i+1,1)]%=mod
      dp[idx(i+1,2)]+=dp[idx(i,4)]+dp[idx(i,5)]
      dp[idx(i+1,2)]%=mod
    elif N[i]=='0':
      dp[idx(i+1,4)]+=dp[idx(i,3)]
      dp[idx(i+1,4)]%=mod
      dp[idx(i+1,5)]+=dp[idx(i,4)]+dp[idx(i,5)]
      dp[idx(i+1,5)]%=mod
    elif int(N[i])<4:
      dp[idx(i+1,5)]+=dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)]
      dp[idx(i+1,5)]%=mod
      dp[idx(i+1,1)]+=dp[idx(i,3)]
      dp[idx(i+1,1)]%=mod
      dp[idx(i+1,2)]+=dp[idx(i,4)]+dp[idx(i,5)]
      dp[idx(i+1,2)]%=mod
      dp[idx(i+1,2)]+=(dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)])*(int(N[i])-1)
      dp[idx(i+1,2)]%=mod
    else:
      dp[idx(i+1,5)]+=dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)]
      dp[idx(i+1,5)]%=mod
      dp[idx(i+1,1)]+=dp[idx(i,3)]
      dp[idx(i+1,1)]%=mod
      dp[idx(i+1,2)]+=dp[idx(i,4)]+dp[idx(i,5)]
      dp[idx(i+1,2)]%=mod
      dp[idx(i+1,2)]+=(dp[idx(i,3)]+dp[idx(i,4)]+dp[idx(i,5)])*(int(N[i])-2)
      dp[idx(i+1,2)]%=mod
      dp[idx(i+1,0)]+=dp[idx(i,3)]+dp[idx(i,5)]
      dp[idx(i+1,0)]%=mod
  print((sum([dp[idx(len(N),i)] for i in range(6)])-1)%mod)
  # for i in range(len(N)+1):
  #   print(dp[i*6:i*6+6])

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)