#include <bits/stdc++.h>
using namespace std;
constexpr int P = 998244353;
int power(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % P;
		a = 1ll * a * a % P;
		b /= 2;
	}
	return res;
}
int main() {
	int n;
	cin >> n;
	int facn = 1;
	for (int i = 1; i <= n; i++) {
		facn = 1ll * facn * i % P;
	}
	vector<int> inv(n + 1);
	inv[1] = 1;
	for (int i = 2; i <= n; i++) {
		inv[i] = 1ll * inv[P % i] * (P - P / i) % P;
	}
	vector<int> len;
	int res = 0;
	auto count = [&]() {
		if (len.size() <= 1 || len[0] != len[1]) {
			return;
		}
		int f = facn;
		for (int i = 0; i < len.size(); i++) {
			for (int j = 1; j <= len[i]; j++) {
				int h = len[i] - j + 1;
				for (int k = i + 1; k < len.size(); k++) {
					h += len[k] >= j;
				}
				f = 1ll * f * inv[h] % P;
			}
		}
		(res += 1ll * f * f % P) %= P;
	};
	function<void(int, int)> dfs = [&](int step, int sum) {
		if (step == 0) {
			if (sum == n) {
				count();
			}
			return;
		}
		for (int i = 0; sum + i <= n; i += step) {
			for (int j = 0; j < i / step; j++) len.push_back(step);
			dfs(step - 1, sum + i);
			for (int j = 0; j < i / step; j++) len.pop_back();
		}
	};
	dfs(n, 0);
	cout << res << "\n";
	return 0;
}