#dp[i][j] : i番目までみて, a[i] - l(a[i]) の総和がjの個数
#dp[n][n-1]が答え.

n = int(input())
mod = 998244353
dp = [[0 for j in range(n)] 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, 10):
			if j+k-1 >= n:
				break
			if 0 <= j+k-1:
				dp[i+1][j+k-1] += dp[i][j]
				dp[i+1][j+k-1] %= mod
		for k in range(10, 100):
			if j+k-2 >= n:
				break
			if 0 <= j+k-2:
				dp[i+1][j+k-2] += dp[i][j]
				dp[i+1][j+k-2] %= mod
		for k in range(100, 206):
			if j+k-3 >= n:
				break
			if 0 <= j+k-3:
				dp[i+1][j+k-3] += dp[i][j]
				dp[i+1][j+k-3] %= mod

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