#include<stdio.h>
#include<ctype.h>
namespace IO {
	constexpr int bufsize = 230005;
	char buf[bufsize], *f1, *f2;
	char gtchar() {return f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++;}
	template<typename T> void read(T &ret)
	{
		int f = ret = 0;
		char ch = gtchar();
		while(!isdigit(ch)) f = ch == '-', ch = gtchar();
		while(isdigit(ch)) ret = (ret << 3) + (ret << 1) + (ch ^ 48), ch = gtchar();
		if(f) ret = -ret;
	}
	template<typename T, typename ...t> void read(T &a, t &...b) {read(a), read(b...);}
}using IO::read;
typedef long long ll;
typedef unsigned long long ull;
constexpr int maxn = 1000005, mod = 998244353;
ll fac[maxn << 1], inv[maxn << 1];
#define Mul(a, b) ((a) * (b) % mod)
ll Add(ll a, ll b) {return (a += b) >= mod? a - mod: a;}
ll Dec(ll a, ll b) {return (a -= b) < 0? a + mod: a;}

void init()
{
	fac[0] = fac[1] = inv[0] = inv[1] = 1;
	for(int i = 2; i < (maxn << 1); i++)
		fac[i] = Mul(fac[i - 1], i),
		inv[i] = Dec(mod, Mul(mod / i, inv[mod % i]));
	for(int i = 2; i < (maxn << 1); i++) inv[i] = Mul(inv[i - 1], inv[i]);
}
ll qpow(ll a, ll b)
{
	ll ret = 1;
	while(b)
	{
		if(b & 1) ret = Mul(ret, a);
		a = Mul(a, a);
		b >>= 1;
	}
	return ret;
}
#define inv(x) (qpow(x, mod - 2))

int n;
int main()
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	init();
	read(n);
	if(n & 1) return puts("0"), 0;
	if(n == 2) return puts("1"), 0;
	n >>= 1;
	ll tmp = Mul(Mul(fac[n << 1], inv[n]), qpow(n, n - 2));
	printf("%lld\n", Mul(tmp, qpow(2, n - 2)));
	return 0;
}