//Start: 2024-11-11 19:27:09
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"(func %s, line #%d): " fmt, __func__, __LINE__, ##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
const int N=1e5+5,mod=998244353;
ll ksm(ll a,int k){ll s=1;while(k){if(k&1) s=s*a%mod;a=a*a%mod;k>>=1;}return s;}
const ll inv3=ksm(3,mod-2);
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
inline ll read(){
  char ch=getchar();ll x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
ll sum(ll x){x%=mod;return x*(x+1)/2%mod;}
ll sum2(ll x){x%=mod;return x*(x+1)/2%mod*(2*x+1)%mod*inv3%mod;}
signed LJY(){
  ll n=read();ll B=sqrt(n);
  ll ans=((n+1)%mod*(sum(n)-sum(B)+mod)-sum2(n)+sum2(B)+mod)%mod;
  For(i,2,B){
    ll now=i,cnt=1;
    while(now<=n){
      ans=(ans+(min(n+1,now*i)-now)%mod*cnt%mod*i)%mod;
      now*=i;cnt++;
    }
  }printf("%lld",ans);
  return 0;
}