#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
int n;
const int N=1e6+10,mod=998244353;
int jc[N];
int qmi(int x,int y) {
	int res=1;
	if(y<0) return 1;
	while(y) {
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}return res;
}
void solve() {
	in(n);
	if(n&1) {
		cout<<0<<endl;
		return;
	}
	jc[0]=1;
	rep(i,1,n) jc[i]=jc[i-1]*i%mod;
	int res=jc[n];
	res=res*qmi(jc[n/2],mod-2)%mod;
	res=res*qmi(qmi(2,n/2),mod-2)%mod;
	res=res*qmi(n/2,(n/2)-2)%mod;
	res=res*qmi(4,(n/2)-1)%mod;
	printf("%lld\n",res);
}
fire main() {
	while(T--) {
		solve();
	}
	return false;
}