#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline

n = int(input())
dp = [[0] * n for _ in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1):
    for j in range(1,n+5):
        dif = j - len(str(j))
        if dif >= n:
            break
        for k in range(n-dif):
            dp[i][k+dif] += dp[i-1][k]
            dp[i][k+dif] %= mod
ans = 0
print(dp[-1][-1])