#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const long long mod = 1012924417;
const int max_n = 2000050;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);



unordered_map<ll,mint> memo;
mint PR(ll t){
    if(memo.count(t))return memo[t];
    else return memo[t]=mint(5).pow(t);
}
unordered_map<ll,mint> memo2;
mint INV(mint p){
    if(memo2.count(p.x))return memo2[p.x];
    else return memo2[p.x]=p.pow(mod-2);
}

namespace NTT {
    //MOD9のNTT auto c=NTT::mul(a,b)で受け取り。
	vector<mint> tmp;
	size_t sz = 1;
    mint PrimitiveRoot=5;
	struct NTTPart {
		static std::vector<mint> ntt(std::vector<mint> a, bool inv = false) {
			size_t mask = sz - 1;
			size_t p = 0;
			for (size_t i = sz >> 1; i >= 1; i >>= 1) {
				auto& cur = (p & 1) ? tmp : a;
				auto& nex = (p & 1) ? a : tmp;
				mint e = PR((mod - 1) / sz * i);
				if (inv) e = INV(e);
				mint w = 1;
				for (size_t j = 0; j < sz; j += i) {
					for (size_t k = 0; k < i; ++k) {
						nex[j + k] = cur[((j << 1) & mask) + k] + cur[(((j << 1) + i) & mask) + k] * w;
					}
					w *= e;
				}
				++p;
			}
			if (p & 1) std::swap(a, tmp);
			if (inv) {
				mint invSz = INV(mint(sz));
				for (size_t i = 0; i < sz; ++i) a[i] *= invSz;
			}
			return a;
		}
		static std::vector<mint> mul(std::vector<mint> a, std::vector<mint> b) {
			a = ntt(a);
			b = ntt(b);
			for (size_t i = 0; i < sz; ++i) a[i] = a[i] * b[i];
			a = ntt(a, true);
			return a;
		}
	};
	std::vector<mint> mul(std::vector<mint> a, std::vector<mint> b) {
		size_t m = a.size() + b.size() - 1;
		sz = 1;
		while (m > sz) sz <<= 1;
		tmp.resize(sz);
		a.resize(sz, 0);
		b.resize(sz, 0);
		vector<mint> c=NTTPart::mul(a, b);
		c.resize(m);
		return c;
	}
};

vm conv(vm a,vm b){
    /*vm c(a.size()+b.size()-1);
    rep(i,a.size())rep(j,b.size())c[i+j]+=a[i]*b[j];
    return c;*/
    vm c=NTT::mul(a,b);
    return c;
}
vm inverse(vm v){
    ll n=v.size();
    vm ret;ret.emplace_back(mint(1)/v[0]);
    while(ret.size()<v.size()){
        //cout << ret.size() << endl;
        ll m=ret.size();
        /*vm tmp=conv(ret,ret);
        tmp.resize(ret.size());
        tmp=conv(v,tmp);
        for(auto &p:tmp)p*=-1;
        rep(i,ret.size()){
            tmp[i]+=ret[i]*2;
        }
        tmp.resize(ret.size()*2);
        ret=tmp;*/
        vm f;rep(i,m*2)f.emplace_back(v[i]);
        auto h=conv(f,ret);
        vm nh;
        rep(i,m){
          nh.emplace_back(h[i+m]);
        }
        nh=conv(ret,nh);
        rep(i,m){
            ret.emplace_back(-nh[i]);
        }
    }
    return ret;
}
vm naive(vm v){
  ll n=v.size();
    vm ret;ret.emplace_back(mint(1)/v[0]);
    while(ret.size()<v.size()){
        ll m=ret.size();
        vm tmp=conv(ret,ret);
        tmp.resize(ret.size());
        tmp=conv(v,tmp);
        for(auto &p:tmp)p*=-1;
        rep(i,ret.size()){
            tmp[i]+=ret[i]*2;
        }
        tmp.resize(ret.size()*2);
        ret=tmp;
        /*auto f=v;f.resize(ret.size()*2);
        auto h=conv(f,ret);
        vm nh;
        rep(i,m){
            nh.emplace_back(h[i+m]);
        }
        nh=conv(ret,nh);
        rep(i,m){
            if(i+m<nh.size())ret.emplace_back(-nh[i+m]);
            else ret.emplace_back(0);
        }*/
    }
    return ret;
}
int main(){
    ll n=1<<19;
    vm s(n);
    rep(i,n){
        if(i&1){
            s[i]=comb.ifact[i];
            if(i&2)s[i]*=-1;
        }
    }
    s[0]=1;
    vm c(n);
    rep(i,n){
        if(i&1)continue;
        c[i]=comb.ifact[i];
        if(i&2)c[i]*=-1;
    }
    auto f=inverse(c);
    f=conv(f,s);
    f.resize(n);
    f=conv(f,f);
    ll m;cin >> m;
    cout << f[m-1]*comb.fact[m-1] << endl;
  
}