#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define lowbit(x) ((x)&(-x))   
#define endl '\n'

typedef long long LL;
typedef pair<int,int> PII;
const int N=1e7+10,M=2e5+10,mod=998244353,INF=0x3f3f3f3f;
int n, m, k;

int fact[N],infact[N];

int qmi(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = 1ll * res * a % mod;
        b /= 2;
        a = 1ll * a * a % mod;
    }
    return res;
}

void init(int x) {
    fact[0] = 1;
    for (int i = 1; i <= x; i ++) {
        fact[i] = 1ll * fact[i - 1] * i % mod;
    }
    infact[x] = qmi(fact[x], mod - 2);
    for (int i = x; i >= 1; i --) {
        infact[i - 1] = 1ll * infact[i] * i % mod;
    }
}

int C(int a, int b) {
    if(a < b || a < 0 || b < 0) return 0;
    return 1ll * fact[a] * infact[b] % mod * infact[a - b] % mod;
}

void solve() {
    cin >> n;
    LL res = 0;
    for (int i = 1; i <= n; i ++) {
        res = (res + 1ll * C(n - i, i - 1) * fact[i - 1] % mod * fact[n - i]) % mod;
    }
    cout << res << endl;
}

int main() {  
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int _;
    _ = 1;
    init(10000000);
    //cin >> _;
    while(_ --) {
        solve();
    }
    return 0;
}