#include<bits/stdc++.h>
// #include<atcoder/all>

using namespace std;
// using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007

vector<int> v(2000000,0);
vector<int> sieve(){
  v[0] = 1;v[1] = 1;
  vector<int> res;
  for(int i = 2;i <= 1000000;i++){
    if(v[i])continue;
    res.push_back(i);
    for(int j = i;j <= 1000000;j+=i)v[j] = i;
  }
  return res;
}
void lcm(map<int,int> &mp,int k){
  mp[v[k]]++;
  if(v[k] == k)return;
  lcm(mp,k/v[k]);
}
int mod = 998244353;

int main(){
  
  int n;
  cin >> n;
  vector<int> p(sieve());
  ll x = 0;
  for(auto au : p){
    if(au > n)break;
    ll k = au;
    while(k*au <= n)k *= au;
    if(k*2 > n)x = k;
  }
  ll res = 1;
  map<int,int> mp;
  for(int i = 2;i <= n;i++){
    if(i == x)continue;
    map<int,int> mpp;
    lcm(mpp,i);
    for(auto au : mpp)mp[au.first] = max(mp[au.first],au.second);
  }
  for(auto &au : mp)while(au.second--)res = res*au.first%mod;
  cout << res << "\n";


  return 0;
}