#include <iostream>
#include <algorithm>
using namespace std;

const long long md = 998244353;

long long d[209][209];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n; cin >> n;
	d[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < n; j++) {
			for (int k = 1; k <= n + 2; k++) {
				int t = k, pn = k;
				while (pn) {
					t--;
					pn /= 10;
				}
				if (j >= t) d[i][j] = (d[i][j] + d[i - 1][j - t]) % md;
			}
		}
	}
	cout << d[n][n - 1] << '\n';
	return 0;
}