#include using namespace std; using ll = long long; #include using namespace atcoder; using mint = modint998244353; vector fact, factinv, inv; const ll mod = 998244353; void prenCkModp(ll n) { fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact[0] = fact[1] = 1; factinv[0] = factinv[1] = 1; inv[1] = 1; for (ll i = 2; i < n + 5; i++) { fact[i] = (fact[i - 1] * i); inv[i] = mod - (inv[mod % i] * (mod / i)); factinv[i] = (factinv[i - 1] * inv[i]); } } mint nCk(ll n, ll k) { if (n < k||k<0) return 0; return fact[n] * (factinv[k] * factinv[n - k]); } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N; cin>>N; if(N<4){ cout<<0<=2;x++){ mint res=fact[N]; res*=factinv[x-2]*factinv[N-x-2]*inv[N-1]*inv[x]*inv[N-x]; an+=res*res; } cout<