// Problem: D. Disjoint LIS
// Contest: Codeforces - 300iq Contest 3
// URL: https://codeforces.com/gym/102538/problem/D
// Memory Limit: 512 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 80;
const ll mod = 998244353;

ll n, F = 1, inv[maxn], a[maxn], ans, b[maxn];

void dfs(int d, int s, int lst) {
	if (s == n) {
		if (a[d - 1] != a[d - 2]) {
			return;
		}
		for (int i = 1; i <= n; ++i) {
			b[i] = 0;
		}
		ll res = F;
		for (int i = 1; i < d; ++i) {
			for (int j = 1; j <= a[i]; ++j) {
				++b[j];
				res = res * inv[b[j] + a[i] - j] % mod;
			}
		}
		ans = (ans + res * res) % mod;
		return;
	}
	for (int i = lst; s + i <= n; ++i) {
		if (s + i < n && s + i + i > n) {
			continue;
		}
		a[d] = i;
		dfs(d + 1, s + i, i);
	}
}

void solve() {
	scanf("%lld", &n);
	if (n == 1) {
		puts("0");
		return;
	}
	inv[1] = 1;
	for (int i = 2; i <= n; ++i) {
		F = F * i % mod;
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	}
	dfs(1, 0, 1);
	printf("%lld\n", ans);
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}