#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


inline long long divide(long long a, int b) {
  return static_cast<double>(a) / b;
}
inline long long divide(long long a, long long b) {
  return static_cast<double>(a) / b;
}

struct Quotients {
  long long N;
  int N2, N3, N4, N6;
  int len;
  Quotients(long long N_ = 0) : N(N_) {
    N2 = sqrt(static_cast<long double>(N));
    N3 = cbrt(static_cast<long double>(N));
    for (; static_cast<long long>(N3) * N3 * N3 < N; ++N3) {}
    for (; static_cast<long long>(N3) * N3 * N3 > N; --N3) {}
    N4 = sqrt(static_cast<long double>(N2));
    N6 = sqrt(static_cast<long double>(N3));
    len = 2 * N2 + ((static_cast<long long>(N2) * (N2 + 1) <= N) ? 1 : 0);
  }
  long long operator[](int i) const {
    return (i <= N2) ? i : divide(N, len - i);
  }
  int indexOf(long long x) const {
    return (x <= N2) ? x : (len - divide(N, x));
  }
  friend std::ostream &operator<<(std::ostream &os, const Quotients &quo) {
    os << "[";
    for (int i = 0; i < quo.len; ++i) {
      if (i > 0) os << ", ";
      os << quo[i];
    }
    os << "]";
    return os;
  }
};


/*
  f(x) = [x <= n] (1 + \sum[1<k<=K] f(k x))
  g(N/x) := f(x)
  g(x) = [x >= 1] (1 + \sum[1<k<=K] g(x/k))
*/

constexpr Int K = 20210926;

int main() {
  Int N;
  for (; ~scanf("%lld", &N); ) {
    Quotients quo(N);
// cerr<<"|quo| = "<<quo.len<<", quo = "<<quo<<endl;
    vector<Mint> dp(quo.len);
    for (int i = 1; i < quo.len; ++i) {
      dp[i] = 1;
      const Int n = quo[i];
      for (Int a = 0, b; a < n; a = b) {
        const Int k = divide(n, a + 1);
        b = divide(n, k);
        // (a, b]: k
        const Int lb = max(a, 1LL);
        const Int ub = min(b, K);
        if (lb < ub) {
          dp[i] += (ub - lb) * dp[quo.indexOf(k)];
        }
      }
    }
    printf("%u\n", dp.back().x);
  }
  return 0;
}