//# pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
#define SZ(x) (int)(x).size()
#define fs first
#define sc second
#define PII pair<int,int>
#define ls(u) (u)<<1
#define rs(u) (u)<<1|1
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vi >
#define vI vector<PII>
#define db double
#define all(a) (a).begin(),(a).end()
#define lowbit(x) (x)&(-x)
#define die cout << "???" << endl
//#define endl '\n'
using namespace std;
const int mod = 998244353;
//const int mod = 1169996969;
//const int mod = 1e9 + 7;
//const int inf = LLONG_MAX;
const int inf = 0x3f3f3f3f;
//const int inf = 1e9;
//const db PI = acos(-1.0);
const db eps = 1e-7;
typedef long long ll;
typedef unsigned long long  ull;
const int N = 1e7+5,M = 2e6+5,K = 20;

inline int rd() {
    int f = 0; int x = 0; char ch = getchar();
    for (; !isdigit(ch); ch = getchar()) f |= (ch == '-');
    for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
    if (f) x = -x;
    return x;
}

void write(ll a) {if(a>=10)write(a/10);putchar(a%10+'0');}
void wt(ll a) {if(a < 0) {putchar('-');a = -a;}write(a);}
void wwt(ll a){wt(a);putchar('\n');}

// int mul(int x, int y, int p)
// {
//     int z = (long double)x / p * y;
//     ll res = (unsigned long long)x * y - (unsigned long long) z * p;
//     return (res + p) % p;
// }

int n,m,k;

template<class T> inline bool smin(T &x,T y) {return x > y?x = y,1:0;}
template<class T> inline bool smax(T &x,T y) {return x < y?x = y,1:0;}

inline int add(int x,int y) {return x + y >= mod?x + y - mod:x+y;}

int fac[N],invf[N];

int fsm(int b,int p)
{
    int res = 1;
    while(p)
    {
        if(p&1) res = res*b%mod;
        b = b*b%mod;
        p >>= 1;
    }

    return res;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r+", stdin);
    freopen("out.txt", "w+", stdout);
    #endif

    fac[0] = fac[1] = 1;
    invf[0] = invf[1] = 1;

    for(int i = 2;i<N;i++)
    {
        fac[i] = fac[i-1]*i%mod;
    }

    invf[N-1] = fsm(fac[N-1],mod-2);

    for(int i = N-2;i;i--)
    {
        invf[i] = invf[i+1]*(i+1)%mod; 
    }

    cin >> n;

    int ans = 0;

    for(int i = 1;n - i >= i - 1;i++)
    {
        int tmp = fac[n-i]*fac[n-i]%mod*invf[n+1 - i*2]%mod;
        ans = add(ans,tmp);
    }

    cout << ans;

    return 0;   
}


// 26 26
// 34 34
// 23 36
// 34 43
// 31 31