#include<bits/stdc++.h>
#define rep1(i, a, b) for(int i = a; i <= b; ++i)
#define rep2(i, a, b) for(int i = a; i >= b; --i)
#define ft first
#define sd second
#define pii pair <int, int>
#define ll long long
#define ld long double
#define pb push_back
#define debug puts("----------------------------")
const int N = 1e6 + 10, mod = 998244353;
using namespace std;
int n; ll fac[N], inv[N];
ll qpow(ll x, ll b) {
    ll res = 1;
    while(b > 0) {
        if(b & 1) res *= x, res %= mod;
        x *= x; x %= mod; b >>= 1;
    } return res;
}
ll C(int x, int y) {return fac[x] * inv[y] % mod * inv[x - y] % mod;}
int main() {
    cin >> n; fac[0] = inv[0] = 1;
    if(n & 1) return cout << 0 << '\n', 0;
    rep1(i, 1, n) fac[i] = fac[i - 1] * i % mod;
    inv[n] = qpow(fac[n], mod - 2);
    rep2(i, n - 1, 1) inv[i] = inv[i + 1] * (i + 1) % mod;
    ll ans = C(n, n / 2) * fac[n / 2] % mod;
    ans *= qpow(n / 2, n / 2 - 2); ans %= mod;
    ans *= qpow(qpow(2, mod - 2), n / 2); ans %= mod;
    ans *= qpow(4, n / 2 - 1); ans %= mod;
    cout << ans << '\n';
    return 0;
}