#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
mint f(ll N){
	if(!N)return 0;
	ll n=round(sqrtl(N));
	while(n*n>N)n--;
	while((n+1)*(n+1)<=N)n++;
	mint ans=n*mint(N-n*n+1)*mint(N+n*n)/2;
	ans+=mint(n-1)*n*(2*n-1)*(3*mint(n)*n-3*n-1)/15+3*mint(n)*n*(n-1)*(n-1)/4+mint(n)*(n-1)*(2*n-1)/6;
	return ans;
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N;cin>>N;
  auto mypow=[](__int128 a,ll n){
  	__int128 res=1;
  	while(n){
  		if(n&1)res*=a;
  		a*=a;
  		n>>=1;
  	}
  	return res;
  };
  vl A;
  rep(k,3,61){
  	ll x=1;
  	while(mypow(x,k)<=N)A.emplace_back(mypow(x++,k));
  }
  A.emplace_back(N+1);
  sort(all(A));
  A.erase(unique(all(A)),A.end());
  mint ans=0;
  rep(i,0,sz(A)-1){
  	ll l=A[i],r=A[i+1];
  	mint s=1;
  	rep(k,3,61){
  		ll x=round(powl(l,(ld)1/k));
  		while(mypow(x,k)<l)x++;
  		while(mypow(x,k)>l)x--;
  		assert(mypow(x,k)==l);
  		s*=x;
  	}
  	ans+=s*(f(r-1)-f(l-1));
  }
  cout<<ans<<endl;
  return 0;
}