#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N;;
  cin >> N;
  vector<bool> prime(N + 1, true);
  for (int i = 2; i <= N; i++){
    if (prime[i]){
      for (int j = i * 2; j <= N; j += i){
        prime[j] = false;
      }
    }
  }
  int f = N;
  while (!prime[f]){
    f--;
  }
  long long ans = 1;
  for (int i = 2; i <= N; i++){
    if (prime[i] && i != f){
      int N2 = N;
      int mul = 1;
      while (N2 >= i){
        N2 /= i;
        mul *= i;
      }
      ans *= mul;
      ans %= MOD;
    }
  }
  cout << ans << endl;
}