#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::static_modint<998244353>;
//using mint = atcoder::static_modint<1000000007>;
using namespace std;
using namespace atcoder;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

int main(){
    int n;
    cin >> n;
    vector<int> a;
    vector<bool> isprime(n+1,true);
    rep(i,2,n+1)if(isprime[i]){
        for(int j=i*2; j<=n; j+=i)isprime[j]=false;
        int k=n,score=0;
        while(k>1){
            score+=k/i;
            k/=i;
        }
        a.push_back(score);
    }
    //for(auto x:a)cout << x << "\n";
    mint ans=0;
    int k=1;
    while(a.size()){
        mint score=1;
        int m=a.size();
        for(int i=m-1; i>=0; i--){
            if(a[i]<k)a.pop_back();
            else score*=(1+a[i]/k);
        }
        ans+=score-1;
        k++;
    }
    cout << ans.val();
}