#include<bits/stdc++.h>
#include<atcoder/all>
namespace my{
using ml=atcoder::modint998244353;
auto&operator>>(std::istream&i,ml&x){int t;i>>t;x=t;return i;}
auto&operator<<(std::ostream&o,const ml&x){return o<<x.val();}
void main();
void solve();
}
int main(){my::main();}
namespace my{
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define FO(n) for(ll ij=0;ij<n;++ij)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
using namespace std;
using dd=long double;
using ll=long long;
constexpr dd ee=1e-12;
constexpr char nl=10;
constexpr char sp=32;
auto range(bool s,ll a,ll b=9e18,ll c=1){if(b==9e18)b=a,(s?b:a)=0;return tuple{a-s,b,c};}
auto zz(auto x){return x<0?-x:x;}
ll sqrt_floor(ll x){ll r=sqrt(zz(x-ee));while(r+1<=x/(r+1))++r;return r;}
bool amax(auto&a,const auto&b){return a<b?a=b,1:0;}
template<class...A>auto max(const A&...a){return max(initializer_list<common_type_t<A...>>{a...});}

template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(std::pair<A,B>p):a(p.first),b(p.second){}
  bool operator==(const pair&p)const{return a==p.a&&b==p.b;}
  auto operator<=>(const pair&p)const{return a!=p.a?a<=>p.a:b<=>p.b;}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<sp<<p.b;}
};

auto pop_back(auto&a){assert(a.size());auto r=*a.rbegin();a.pop_back();return r;}

template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.first>>p.second;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.first<<sp<<p.second;}

template<class T,class U>ostream&operator<<(ostream&o,const unordered_map<T,U>&m){fe(m,e)o<<e.first<<sp<<e.second<<nl;return o;}
template<size_t n>ostream&operator<<(ostream&o,const bitset<n>&b){fo(i,n)o<<b[i];return o;}

template<class T>struct unordered_set:std::unordered_set<T>{
  unordered_set(const initializer_list<T>&a={}){fe(a,e)this->emplace(e);}
  unordered_set(const vector<T>&a){fe(a,e)this->emplace(e);}
  friend ostream&operator<<(ostream&o,const unordered_set&s){fe(s,e)o<<e<<string(&e!=&s.back(),sp);return o;}
};

template<class V>concept isv=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct core_type{using type=T;};
template<isv V>struct core_type<V>{using type=typename core_type<typename V::value_type>::type;};
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),isv<V>?nl:sp);return o;}

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){fe(v,e)this->eb(e);}
  template<size_t n>vec(const bitset<n>&a){fo(i,n)this->eb(a[i]);}

  vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}
  vec&operator^=(const vec&u){fe(u,e)this->eb(e);return*this;}
  vec operator+(const vec&u)const{return vec(*this)+=u;}
  vec operator-(const vec&u)const{return vec(*this)-=u;}
  vec operator^(const vec&u)const{return vec(*this)^=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}

  auto scan(auto f)const{pair<typename core_type<V>::type,bool>r{};fe(*this,e)if constexpr(!isv<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}
  auto max()const{return scan([](auto&a,const auto&b){a<b?a=b:0;}).a;}
};

void io(){cin.tie(0)->sync_with_stdio(0);cout<<fixed<<setprecision(15);cerr<<nl;}
void lin(auto&...a){(cin>>...>>a);}
template<char c=sp>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<nl;}

namespace sgt{
template<class T>T max(T a,T b){return b<a?a:b;}
}

vec<ll>prime_enumerate(ll n){
  vec<bool>sieve(n/3+1,1);
  for(ll p=5,d=4,i=1,rn=sqrt_floor(n);p<=rn;p+=d=6-d,i++){
    if(!sieve[i])continue;
    for(ll q=(p*p)/3,r=d*p/3+(d*p%3==2),s=p*2;q<sieve.size();q+=r=s-r)sieve[q]=0;
  }
  vec<ll>r{2,3};
  for(ll p=5,d=4,i=1;p<=n;p+=d=6-d,i++)if(sieve[i])r.eb(p);
  while(r.size()&&r.back()>n)r.pop_back();
  return r;
}

template<class T>bool amax(pair<T,T>&p,pair<T,T>q){if(p.a<q.a)return p.b=max(p.a,q.b),p.a=q.a,1;else return amax(p.b,q.a);}

void main(){io();ll T=1;fo(T)solve();}
void solve(){
  LL(N);
  auto primes_vec=prime_enumerate(N);

  unordered_set<ll>primes(primes_vec);

  unordered_map<ll,ll>E;
  fe(primes,p){
    for(ll t=p;t<=N;t*=p){
      E[p]+=N/t;
    }
  }

  ll B=0;
  fe(E,p,b)amax(B,b);

  ml ans=0;
  fo(i,1,B+1){
    ml t=1;

    unordered_set<ll>del;
    fe(primes,p){
      t*=(1+E[p]/i);
      if(E[p]/i==0)del.emplace(p);
    }
    t--;
    ans+=t;

    fe(del,p)primes.erase(p);
  }
  pp(ans);
}}