import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())


mod = 998244353

N = int(input())
dp = [[0 for j in range(N+1)] for i in range(N+1)]
dp[0][0] = 1
for i in range(N):
    for j in range(N):
        for k in range(1,2*N+1):
            p = len(str(k))
            if j+k-p <= N:
                dp[i+1][j+k-p] += dp[i][j]
                dp[i+1][j+k-p] %= mod
print(dp[N][N-1])