#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL

int main(){
	vector<long long> p;
	vector<vector<long long>> ps(1000001,vector<long long>());
	for(long long i=1;i<=1000000;i++){
		if(i==1)continue;
		if(ps[i].size()!=0)continue;
		p.push_back(i);
		for(long long j=i;j<=1000000;j+=i){
			ps[j].push_back(i);
		}
	}
	reverse(p.begin(),p.end());
	long long n;
	cin>>n;
	vector<mint> dp;
	rep(i,p.size()){
		long long cnt = 0;
		{
			long long t = n;
			while(t!=0){
				cnt += t/p[i];
				t /= p[i];
			}
		}
		vector<mint> ndp(cnt+1);
		while(dp.size()<ndp.size())dp.push_back(0);
		ndp = dp;
		
		{
			mint sum = 0;
			int cr = cnt+1;
			vector<long long> cs(cnt+1);
			for(long long j=1;j<=cnt;j++){
				long long nv = cnt/j;
				while(cr > nv){
					cr --;
					sum += dp[cr];
				}
				ndp[nv] += sum;
				cs[nv]++;
				ndp[nv]++;
			}
			for(int j=cnt;j>=1;j--){
				cs[j-1] += cs[j];
			}
			for(int j=1;j<cnt;j++){
				ndp[j] += dp[j] * cs[j+1];
			}
		}
		swap(dp,ndp);
	}
	mint ans = 0;
	rep(i,dp.size()){
		ans += dp[i] * i;
	}
	cout<<ans.val()<<endl;
	return 0;
}