#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false), cin.tie(nullptr);
#define int long long
#define ll long long
#define int128 __int128
#define ull unsigned long long
#define endl "\n"
#define pi acos(-1)
typedef pair<int, int> pii;
const double eps = 1e-6;
const int N = 1e7 + 10, M = 1010, INF = 1e18;
const int mod = 998244353;

int p[N];
int inv[N];

int qmi(int a, int k)
{
    int res = 1;
    while (k)
    {
        if (k & 1)
            res = res * a % mod;
        a = a * a % mod;
        k >>= 1;
    }
    return res;
}

void init(int n)
{
    p[0]=1;
    for(int i=1;i<=n;i++)
    {
        p[i]=p[i-1]*i%mod;
    }
    inv[n]=qmi(p[n],mod-2);
    for(int i=n-1;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
}

int C(int a,int b)
{
    int x=inv[b]*inv[a-b]%mod;
    return p[a]*x%mod;
}
void solve()
{
    init(1e7+7);
    int n;
    cin>>n;
    int ans=0;
    for(int i=1;i<=(n+1)/2;i++)
    {
        int x=p[n-i]*p[i-1]%mod;
        ans=(ans+x*C(n-i,i-1)%mod+mod)%mod;
    }
    cout<<ans<<endl;
}
signed main()
{
    ios;
    int T = 1;
    // cin >> T;
    // cout << fixed << setprecision(8);
    for (int i = 1; i <= T; i++)
    {
        // cout << "Case " << i << ": ";
        solve();
    }

    return 0;
}