#include <bits/stdc++.h>
#define re register
#define int long long
#define Add(a,b) (((a) + (b)) % mod)
#define Mul(a,b) ((a) * (b) % mod)
#define chMul(a,b) (a = Mul(a,b))

using namespace std;

const int N = 1e6 + 10;
const int mod = 998244353;
int n;
int fac[N],infac[N];

inline int read(){
    int r = 0,w = 1;
    char c = getchar();
    while (c < '0' || c > '9'){
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9'){
        r = (r << 3) + (r << 1) + (c ^ 48);
        c = getchar();
    }
    return r * w;
}

inline int qmi(int a,int b){
    int res = 1;
    while (b){
        if (b & 1) chMul(res,a);
        chMul(a,a); b >>= 1;
    }
    return res;
}

inline void init(int n){
    fac[0] = 1;
    for (re int i = 1;i <= n;i++) fac[i] = Mul(fac[i - 1],i);
    infac[n] = qmi(fac[n],mod - 2);
    for (re int i = n - 1;~i;i--) infac[i] = Mul(infac[i + 1],i + 1);
}

signed main(){
    init(n = read());
    if (n & 1) puts("0");
    else if (n == 2) puts("1");
    else{
        int ans = 1,num = n / 2;
        for (re int i = 0;i < num - 1;i++) chMul(ans,(n - 2 * i) * (n - 2 * i - 1) / 2 % mod);
        // cerr << num << " " << ans << " ???\n";
        chMul(ans,infac[num]);
        // cerr << num << " " << ans << " ???\n";
        if (num >= 2) chMul(ans,qmi(num,num - 2));
        chMul(ans,qmi(4,num - 1)); printf("%lld",ans);
    }
    return 0;
}