#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll N;
const ll mo=998244353;

ll P[1<<20][61];
int C[61];
ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}


ll F(ll n) {
	ll m=sqrt(n);
	while(m*m>n) m--;
	while((m+1)*(m+1)<=n) m++;
	
	ll a=(8*m*m-5*m-2)%mo*(m-1)%mo*m%mo*(m+1)%mo*modpow(20);
	ll b=(n-m*m)%mo*((n+m*m-1)%mo)%mo*m%mo*modpow(2);
	return (a+b)%mo;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	
	for(i=1;i<=1000002;i++) {
		ll cur=1;
		for(j=1;j<=60;j++) {
			if((N+1)/i<cur) cur=N+1;
			else cur*=i;
			P[i][j]=cur;
		}
	}
	FOR(i,61) C[i]=1;
	
	ll cur=1;
	ll ret=0;
	while(cur<=N) {
		ll nex=N+1;
		ll v=1;
		for(i=3;i<=60;i++) {
			if(cur>=P[C[i]+1][i]) C[i]++;
			nex=min(nex,P[C[i]+1][i]);
			v=v*C[i]%mo;
		}
		ret+=v*(F(nex)-F(cur))%mo;
		cur=nex;
	}
	cout<<(ret%mo+mo)%mo<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}