#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n;
  cin >> n;
  struct Q {
    ll t;
    mint c;
  };
  vector<Q> evs;
  rep(k, 60) if (k >= 3) {
    for (int i = 2;; i++) {
      ll v = 1;
      rep(_, k) if (__builtin_mul_overflow(v, i, &v)) v = n + 1;
      if (v > n) break;
      evs.emplace_back(v, mint(i) / mint(i-1));
    }
  }
  ranges::sort(evs, {}, &Q::t);
  evs.emplace_back(n + 1, 0);
  ll t = 1;
  mint c = 1;
  mint ans;
  static const mint inv2 = mint(2).inv();
  auto f1 = [](ll l, ll r) {
    return mint(l + r - 1) * (r - l) * inv2;
  };
  for (auto [nt, nc] : evs) {
    ll l = t, r = nt;
    ll sql = sqrt(l);
    ll nl = (sql + 1) * (sql + 1);
    if (nl >= r) {
      ans += c * sql * f1(l, r);
    } else {
      ans += c * sql * f1(l, nl);
      sql++;
      ll sqr = sqrt(r);
      ll nr = sqr * sqr;
      ans += c * sqr * f1(nr, r);
      mint L = sql, R = sqr;
      static const mint inv20 = mint(20).inv();
      ans += c * inv20 * ((R - 1) * R * (R + 1) * (R * (8 * R - 5) - 2) - (L - 1) * L * (L + 1) * (L * (8 * L - 5) - 2));
    }
    t = nt;
    c *= nc;
  }
  cout << ans.val() << '\n';
}