#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define int long long
#define inf 1e18
#define rep(i, l, n) for (int  i = l; i <= n; i++)
#define per(i, l, n) for (int  i = n; i >= l; i--)
//cout<<fixed<<setprecision(15)
const int mol=998244353;
const int N = 1e7+10,M=5010;
int qmi(int a,int k){int res=1;while(k){if(k&1)res=res*a%mol;a=a*a%mol;k>>=1;}return res;}
int inv(int x){return qmi(x%mol,mol-2);}
int n,m,q,k;
int fact[N];
int infact[N];
int C(int x,int y)
{
  if(x<y)return 0;
  return fact[x]*infact[y]%mol*infact[x-y]%mol;
}
void solve()
{
  
  fact[0]=infact[0]=1;
  rep(i,1,1e7)fact[i]=fact[i-1]*i%mol;
  infact[10000000]=inv(fact[10000000]);
  per(i,1,1e7-1)infact[i]=infact[i+1]*(i+1)%mol;
  cin>>n;
  int ans=fact[n-1];
  rep(i,2,n)
  {
    ans+=C(n-i,i-1)*fact[i-1]%mol*fact[n-i]%mol;
    ans%=mol;
  }
  cout<<ans<<endl;
}
signed main()
{
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  int T = 1;
   //cin>>T;
  for (int i = 1; i <= T; i++)solve();
  return 0;
}