#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    using P = pair<ll,ll>;
    const int INF=1001001001;
    const int 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 pm=n;
      while(!prime[pm]){pm--;}
      ll ans=1;
      for(int i=2;i<=n;i++){
        if(prime[i]&&i!=pm){
          ll now=n,sum=1;
          while(now>=i){now/=i;sum*=i;}
          ans=ans*sum%mod;
        }
      } 
      cout<<ans<<endl;
      return 0;
    }