MOD = 998244353

n = int(input())

max_s = n - 1

# Precompute g(s) for each s from 0 to max_s
g = [0] * (max_s + 1)
for s in range(max_s + 1):
    count = 0
    d = 1
    while True:
        lower = 10 ** (d - 1) - d
        if lower > s:
            break
        upper = (10 ** d) - d - 1
        if s <= upper:
            count += 1
        d += 1
    g[s] = count

# Initialize DP table
dp = [[0] * (n) for _ in range(n + 1)]
dp[0][0] = 1

for i in range(n):
    for current_sum in range(n):
        current = dp[i][current_sum]
        if current == 0:
            continue
        
        if i == n - 1:
            # Last element, s must be exactly (n-1 - current_sum)
            s = (n - 1) - current_sum
            if s < 0 or s > max_s:
                continue
            ways = g[s]
            if ways == 0:
                continue
            new_sum = current_sum + s
            if new_sum < n:
                dp[i+1][new_sum] = (dp[i+1][new_sum] + current * ways) % MOD
        else:
            max_s_possible = (n - 1) - current_sum
            for s in range(0, max_s_possible + 1):
                if s > max_s:
                    continue
                ways = g[s]
                if ways == 0:
                    continue
                new_sum = current_sum + s
                if new_sum < n:
                    dp[i+1][new_sum] = (dp[i+1][new_sum] + current * ways) % MOD

print(dp[n][n-1] % MOD)