#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using lb = long double;
#define fi first
#define se second
#define pb push_back

constexpr ll mod = 998244353;

bool isprime(int num){
  if(num<2) return false;
  else if(num==2) return true;
  else if(num%2==0) return false;
  double sqrtNum=sqrt(num);
  for(int i=3;i<=sqrtNum;i+=2){
    if(num%i==0){
      return false;
    }
  }
  return true;
}
ll mpower(ll a,ll b,ll c){
  ll z;
  if(b==0){
    z=1;
    z%=c;
    return z;
  }
  if(b==1){
    z=a;
    z%=c;
    return z;
  }
  if(b%2==0){
    z=mpower(a,b/2,c);
    return (z*z)%c;
  }
  else{
    z=mpower(a,b-1,c);
    return (z*mpower(a,1,c))%c;
  }
}
//aのｂ乗をｃで割った余り

int main(){
  ll n;
  cin>>n;
  ll ans=1;
  for(int i=1;i<=n;i++){
    if(isprime(i)==true){
      ll x=i;
      while(x*i<=n){
        x*=i;
      }
      ans*=x;
      ans%=mod;
    }
  }
  
  for(int i=n;i>=1;i--){
    if(isprime(i)==true){
      ans*=mpower(i,mod-2,mod);
      ans%=mod;
      break;
    }
  }
  
  cout<<ans<<endl;
}