#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ず-mod<a<modの時.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a<0?a+mod:a;} mint(long long a){v = a<0?a+mod:a;}
    mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(const long long a,long long b){
        mint ret = 1,p = a;
        while(b){
            if(b&1) ret *= p;
            p *= p; b >>= 1;
        }
        return ret;
    };
 
    mint &operator=(const mint &b) = default;
    mint operator-() const {return mint(0)-(*this);}
    mint operator+(const mint b){return mint(v)+=b;}
    mint operator-(const mint b){return mint(v)-=b;}
    mint operator*(const mint b){return mint(v)*=b;}
    mint operator/(const mint b){return mint(v)/=b;}
 
    mint operator+=(const mint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    mint operator-=(const mint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    mint operator*=(const mint b){v = v*b.v%mod; return *this;}
    mint operator/=(mint b){
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
 
    mint operator++(int){*this += 1; return *this;}
    mint operator--(int){*this -= 1; return *this;}
    bool operator==(const mint b){return v == b.v;}
    bool operator!=(const mint b){return v != b.v;}
    bool operator>(const mint b){return v > b.v;}
    bool operator>=(const mint b){return v >= b.v;}
    bool operator<(const mint b){return v < b.v;}
    bool operator<=(const mint b){return v <= b.v;}
 
    mint pow(const long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    if(N%2){cout << 0 << endl; return 0;}

    int Limit = 4*N; //Limit 必要なサイズ fac->x! facinv->1/x! inv->1/x.
    vector<mint> fac(Limit+1,1); for(int i=1; i<=Limit; i++) fac.at(i) = fac.at(i-1)*i;
    vector<mint> facinv(Limit+1); facinv.at(min((int)mod-1,Limit)) = fac.at(min((int)mod-1,Limit)).inv();
    for(int i=min((int)mod-2,Limit-1); i>=0; i--) facinv.at(i) = facinv.at(i+1)*(i+1);
    //vector<mint> inv(Limit+1); for(int i=1; i<=Limit; i++) inv.at(i) = fac.at(i-1)*facinv.at(i); //必要なら解放!.
    auto nCr = [&](int n, int r) -> mint {
        if(n < r || r < 0 || n < 0) return 0;
        return fac.at(n)*facinv.at(r)*facinv.at(n-r);
    };
    N /= 2; N--;
    cout << (mint(2).pow(2*N+1)-nCr(2*N+3,N+1)+nCr(2*N+1,N)).v << endl; return 0;
    string s = "";
    for(int i=0; i<N/2; i++) s += '(';
    for(int i=0; i<N/2; i++) s += ')';

    int answer = 0;
    do{
        int sum = 0,now = 0;
        for(auto c : s){
            if(c == ')') now--,sum += now;
            else now++;
            if(now < 0){sum = 0; break;}
        }
        answer += sum;
    }while(next_permutation(s.begin(),s.end()));
    cout << answer << endl;
}