def popcount(n):
  c=(n&0x5555555555555555)+((n>>1)&0x5555555555555555)
  c=(c&0x3333333333333333)+((c>>2)&0x3333333333333333)
  c=(c&0x0f0f0f0f0f0f0f0f)+((c>>4)&0x0f0f0f0f0f0f0f0f)
  c=(c&0x00ff00ff00ff00ff)+((c>>8)&0x00ff00ff00ff00ff)
  c=(c&0x0000ffff0000ffff)+((c>>16)&0x0000ffff0000ffff)
  c=(c&0x00000000ffffffff)+((c>>32)&0x00000000ffffffff)
  return c
mod = 998244353
N = input()
le = len(N)
dp = [[0 for j in range(1 << 10)] for i in range(le)]
S = 0
for i in range(le):
  for n in range(int(N[i])):
    if i == 0 and n == 0:
      continue
    dp[i][S ^ (1 << n)] += 1
  S ^= (1 << int(N[i]))
  if i == 0:
    continue
  for n in range(1,10):
    dp[i][1 << n] += 1
  for j in range(1 << 10):
    for n in range(10):
      dp[i][j ^ (1 << n)] = (dp[i][j ^ (1<<n)] + dp[i-1][j]) % mod

if S == 0:
  dp[-1][0] += 1
ans = dp[-1][0] % mod
print(ans)