https://codeforces.com/contest/1091/problem/D

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=998244353;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int a;
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);
    ll ans=1;
    ll tmp=0;
    for(int i=1;i<=n;i++ ){
            ans=(ans*i)%MOD;
        if(i!=1)
            tmp=((tmp+1)*i)%MOD;
    }
    cout << ((ans*n)%MOD-tmp%MOD+MOD)%MOD << endl;
    //cout << "Hello world!" << endl;
    return 0;
}