N=int(input())

Mod=998244353

K=max(30,N+20)
d=[0]*K
for i in range(K):
    d[i]=len(str(i))

DP=[[0]*K for _ in range(N+1)]
DP[0][0]=1

for i in range(1,N+1):
    for j in range(K):
        for k in range(1,K):
            if j+k-d[k]<K:
                DP[i][j+k-d[k]]+=DP[i-1][j]
    for j in range(1,K):
        DP[i][j]%=Mod

print(DP[N][N-1])