/**
	author:  shobonvip
	created: 2026.04.19 07:00:52
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

//defmodfact
const int COMinitMAX = 2998244;
mint fact[COMinitMAX+1], factinv[COMinitMAX+1];

void modfact(){
	fact[0] = 1;
	for (int i=1; i<=COMinitMAX; i++){
		fact[i] = fact[i-1] * i;
	}
	factinv[COMinitMAX] = fact[COMinitMAX].inv();
	for (int i=COMinitMAX-1; i>=0; i--){
		factinv[i] = factinv[i+1] * (i+1);
	}
}

mint cmb(int a, int b){
	if (a<b || b<0) return mint(0);
	return fact[a]*factinv[b]*factinv[a-b];
}

mint inv(int a) {
	return fact[a-1] * factinv[a];
}
//--------

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	modfact();

	auto inner = [&](ll n) -> mint {
		ll f = (ll)sqrtl(n);
		mint ans = mint(f-1)*f*(f+1)*(8*mint(f)*f-5*f-2)*inv(20);
		ans += mint(f) * (mint(n) * mint(n+1) * inv(2) - mint(f*f) * mint(f*f-1) * inv(2));
		//cout << n << ' ' << ans.val() << endl;
		return ans;
	};
	
	ll n; cin >> n;
	vector<tuple<ll,int>> event(0);
	for (ll i=2; i*i*i<=n; i++) {
		ll x = i*i*i;
		int t = 3;
		while (true) {
			event.emplace_back(x, t);
			if ((__int128)x * i > n) break;
			x *= i;
			t++;
		}
	}

	sort(all(event));
	ll now = 1;
	vector<ll> vals(64, 1);
	mint prod = 1;
	mint ans = 0;
	for (auto [ub,y]: event) {
		ans += prod * (inner(ub - 1) - inner(now - 1));
		now = ub;
		prod *= inv(vals[y]);
		vals[y]++;
		prod *= vals[y];
	}
	ans += prod * (inner(n) - inner(now - 1));
	cout << ans.val() << endl;




}