#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

/*
    Max_Prime以下の素数をprimes[]に格納
*/

const int Max_Prime = 1100000;
int tmp_primes[Max_Prime];
vector<int> primes;

void PrimeInit() {
    rep(i,Max_Prime)tmp_primes[i] = 1;
    tmp_primes[0] = 0;
    tmp_primes[1] = 0;

    rep(i,Max_Prime){
        if(tmp_primes[i] == 0)continue;
        int j = 2;
        while(i * j < Max_Prime){
            tmp_primes[i*j] = 0;
            j++;
        }
    }
    
    rep(i,Max_Prime){
        if(tmp_primes[i])primes.push_back(i);
    }
}

int main() {
    PrimeInit();
    int n; cin >> n;
    int ma = 0;
    srep(i,1,n+1) if(tmp_primes[i]) ma = i;
    ll ans = 1;
    const ll MOD = 998244353;
    srep(i,1,n+1){
        if(i == ma) continue;
        ans = ans * i % MOD;
    }
    cout << ans << endl;
    return 0;
}