#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> p11;
typedef pair<string, int> ps1;
typedef pair<ll, ll> p1111;
#define vv vector
#define pb emplace_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fi first
#define se second
#define endl '\n'
#define Endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define per(a, b, c) for(int a = (b); a <= (c); a ++)
#define rep(a, b, c) for(int a = (b); a >= (c); a --)
#define aper(A) for(auto i : A) cout << i << ' ';cout << '\n'
#define lowbit(x) ((x) & (-x))
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define PAI acos(-1)
#define int long long
using ll = long long;
void umin(int &x,int y){if(x>y)x=y;}
void umax(int &x,int y){if(x<y)x=y;}

int qsm(int a, int b, int p)
{
    int ans = 1;
    while(b)
    {
        if(b & 1) ans = ans * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return ans;
}

const int mod = 998244353;
const int N = 1e7 + 10;

int fac[N], infac[N];

void pre_work()
{
    fac[0] = fac[1] = 1;
    for(int i = 2; i < N; i ++)
        fac[i] = fac[i - 1] * i % mod;
    infac[N - 1] = qsm(fac[N - 1], mod - 2, mod);
    for(int i = N - 2; i >= 1; i --)
    {
        infac[i] = infac[i + 1] * (i + 1) % mod;
    }
    infac[0] = infac[1] = 1;
}
int n;

int cal(int i)
{
    return fac[n - i] * fac[n - i] % mod * infac[n - 2 * i + 1] % mod;
}

void solve()
{
    cin >> n;
    int ans = 0;
    for(int i = 1; i <= n; i ++)
    {
        if(n - i < i - 1)  break;
        ans = (ans + cal(i)) % mod;
    }
    cout << ans << endl;
}

signed main()
{
  	IOS;
	int tt = 1;
	//cin >> tt;
	pre_work();
	while(tt --)
	{
		solve();
	}
	return 0;
}