#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
//unsigned 
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int mod = 998244353;
const int P = 998244353;
const int INF = 0x3f3f3f3f;
const int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
const int fx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, fy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const double eps=1e-6;
LL inf = 1e18;

const int N = 2e7+10, M = 100010;

LL fact[N],infact[N];

LL qmi(LL a,LL b)
{
    LL ans = 1;
    while (b)
    {
        if (b&1)ans = ans * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return ans;
}

void init()//需要初始化的数量
{
    int m = 1e7+9;
    fact[0] = infact[0] = 1;
    for (int i = 1; i<=m; i++)fact[i] = fact[i-1] * i % mod;
    infact[m] = qmi(fact[m] ,mod-2);
    for (int i = m-1; i>=1; i--)infact[i] = infact[i+1] * (i+1) % mod;
}

LL c(int a,int b)
{
    if (a<0 || b<0 || a<b)return 0;

    return  (LL)fact[a] * infact[b] % mod * infact[a-b] % mod;
}
void solve()
{   
    init();
    int n;
    cin >> n;
    LL ans = 0;
    for (int i = 1; i<=n; i++){
        ans = (ans + c(n-i,i-1) * fact[n-i] % P * fact[i-1] % P) % P; 
    }
    cout << ans <<'\n';
    
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout.precision(6); cout.setf(ios::fixed);
    int t = 1;
    //cin >> t;
    while (t--)
    solve();    

    return 0;
}