#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define PII pair<double,int>
const int maxn=1e7+5;
const int mod=998244353;
int dp[maxn],p[maxn];
ll pow(ll a, ll b, ll m)
{
    ll ans = 1;
    a %= m;
    while(b)
    {
        if(b & 1)ans = (ans % m) * (a % m) % m;
        b /= 2;
        a = (a % m) * (a % m) % m;
    }
    ans %= m;
    return ans;
}
ll inv(ll x, ll p)//x关于p的逆元，p为素数
{
    return pow(x, p - 2, p);
}
ll C(ll n, ll m, ll p)//组合数C(n, m) % p
{
    if(m > n)return 0;
    ll up = 1, down = 1;//分子分母;
    for(int i = n - m + 1; i <= n; i++)up = up * i % p;
    for(int i = 1; i <= m; i++)down = down * i % p;
    return up * inv(down, p) % p;
}
ll Lucas(ll n, ll m, ll p)
{
    if(m == 0)return 1;
    return C(n % p, m % p, p) * Lucas(n / p, m / p, p) % p;
}

signed main(){
    // ios::sync_with_stdio(false);
    // cin.tie(0),cout.tie(0);
    
    int n;cin>>n;
    p[1]=1;
    dp[1]=1;
    dp[2]=1;
    dp[3]=3;
    // dp[4]=10;
    for(int i=2;i<=n;i++){
        p[i]=p[i-1]*i;
        p[i]%=mod;
    }
    int ans=p[n-1];
    int s=1,x=n-2;
    for(int i=2;i<=n;i++){
        // int temp=Lucas(x,s,mod)*inv(Lucas(n-1,i-1,mod),mod);
        // temp*=p[n-1];
        // temp%=mod;
        int temp=Lucas(x,s,mod)*p[n-1]%mod;
        ans+=temp*inv(Lucas(n-1,i-1,mod),mod);
        ans%=mod;
        // printf("%d %d %d\n",s,x,p[n-1]);
        x--;s++;
        if(s>x)break;
        
    }
    if(n==1)ans=1;
    cout<<ans<<endl;


    
    
}