#include <bits/stdc++.h>
#include "atcoder/all"

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}


struct Binomial {
	static constexpr int MOD = 998244353;
	static constexpr int MAX_N = 2e6 + 10;
	std::array<long long, MAX_N> fac, invfac, inv;
	Binomial() : fac(), invfac(), inv() {
		fac[0] = fac[1] = 1;
		invfac[0] = invfac[1] = 1;
		inv[1] = 1;
		for (int i = 2; i < MAX_N; i++) {
			fac[i] = fac[i - 1] * i % MOD;
			inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
			invfac[i] = invfac[i - 1] * inv[i] % MOD;
		}
	}
	long long P(int n, int k) const {
		if (!(0 <= k && k <= n)) return 0;
		return fac[n] * invfac[n - k] % MOD;
	}
	long long C(int n, int k) const {
		if (!(0 <= k && k <= n)) return 0;
		return fac[n] * invfac[k] % MOD * invfac[n - k] % MOD;
	}
	long long H(int n, int k) const {
		if (n < 0 || k < 0) return 0;
		return k == 0 ? 1 : C(n + k - 1, k);
	}
} const bn;

using mint = atcoder::modint998244353;

void solve() {
	int n;
	cin >> n;
	vector dp(n + 1, vector<mint>(n, 0));
	dp[1][1] = 1;
	dp[2][1] = 1;
	rep(i, 1, n) {
		rep(j, 0, n) {
			if(dp[i][j] == 0) continue;
			if(i + 2 <= n) dp[i + 2][j + 1] += dp[i][j];
			if(i + 3 <= n) dp[i + 3][j + 1] += dp[i][j];
		}
	}
	mint ans = 0;
	rep(i, 0, n) ans += (dp[n][i] + dp[n - 1][i]) * bn.fac[i] * bn.fac[n - i];
	cout << ans.val() << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}