#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
using namespace std;
const int N = 1e6 + 9, MOD = 998244353;
typedef long long ll;

ll read() {
  ll x = 0, s = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-')
      s = -1;
  for (; isdigit(ch); ch = getchar())
    x = x * 10 + (ch ^ 48);
  return x * s;
}

ll mod_pow(ll x, ll y) {
  ll res = 1;
  for (; y; y >>= 1) {
    if (y & 1)
      res = res * x % MOD;
    x = x * x % MOD;
  }
  return res;
}

ll inv2 = mod_pow(2, MOD - 2), inv6 = mod_pow(6, MOD - 2);
ll n, sqn;
ll v[N], primes[N], cnt, sp1[N], sp2[N], ind1[N], ind2[N], w[N], tot, g1[N],
    g2[N];

void init(int s) {
  memset(v, 0, sizeof(v));
  memset(primes, 0, sizeof(primes));
  memset(sp1, 0, sizeof(sp1));
  memset(sp2, 0, sizeof(sp2));
  memset(ind1, 0, sizeof(ind1));
  memset(ind2, 0, sizeof(ind2));
  memset(w, 0, sizeof(w));
  memset(g1, 0, sizeof(g1));
  memset(g2, 0, sizeof(g2));
  cnt = tot = 0;

  for (int i = 2; i <= s; ++i) {
    if (!v[i]) {
      v[i] = i, primes[++cnt] = i;
      sp1[cnt] = (sp1[cnt - 1] + i) % MOD;
      sp2[cnt] = (sp2[cnt - 1] + 1LL * i * i) % MOD;
    }
    for (int j = 1; j <= cnt && i * primes[j] <= s; ++j) {
      v[i * primes[j]] = primes[j];
      if (i % primes[j] == 0)
        break;
    }
  }
}

// ll S(ll x, ll y) {
//   if (primes[y] >= x)
//     return 0;
//   ll k = x <= sqn ? ind1[x] : ind2[n / x];
//   // ll res = ((g2[k] - g1[k]) - (sp2[y] - sp1[y])) % MOD;
//   ll res = (g2[k] - sp2[y]) % MOD;
//   for (int i = y + 1; i <= cnt && primes[i] * primes[i] <= x; ++i) {
//     ll pe = primes[i];
//     for (ll e = 1; pe <= x; e++, pe = pe * primes[i]) {
//       ll z = pe % MOD;
//       res = res + z * z % MOD * (S(x / pe, i) + (e > 1));
//       res %= MOD;
//     }
//   }
//   return res;
// }

pair<ll, ll> solve(ll n) {
  // freopen("1.in", "r", stdin);
  // n = read();
  sqn = sqrt(n);
  init(sqn);
  for (ll i = 1, j; i <= n; i = j + 1) {
    j = n / (n / i);
    w[++tot] = n / i;
    g1[tot] = n / i % MOD;
    g2[tot] =
        g1[tot] * (g1[tot] + 1) % MOD * (2 * g1[tot] + 1) % MOD * inv6 % MOD -
        1;
    g1[tot] = g1[tot] * (g1[tot] + 1) / 2 % MOD - 1;
    if (n / i <= sqn)
      ind1[n / i] = tot;
    else
      ind2[n / (n / i)] = tot;
  }
  // for (int i = 1; i <= 20; ++i) {
  //   int k = w[i] <= sqn ? ind1[w[i]] : ind2[n / w[i]];
  //   cout << w[i] << ' ' << k << ' ' << g1[k] << ' ' << g2[k] << '\n';
  // }
  // cout << '\n';
  for (int i = 1; i <= cnt; ++i) {
    for (int j = 1; j <= tot && primes[i] * primes[i] <= w[j]; j++) {
      ll k = w[j] / primes[i] <= sqn ? ind1[w[j] / primes[i]]
                                     : ind2[n / (w[j] / primes[i])];
      g1[j] -= primes[i] * (g1[k] - sp1[i - 1]);
      g1[j] %= MOD;
      g2[j] -= primes[i] * primes[i] % MOD * (g2[k] - sp2[i - 1]);
      g2[j] %= MOD;
    }
  }
  // printf("%lld\n", (S(n, 0) + 1 + MOD) % MOD);
  int k = n <= sqn ? ind1[n] : ind2[n / n];
  // printf("%lld\n", g2[k]);
  // printf("%lld\n", g1[k]);
  return {g1[k], g2[k]};
}

ll S1(ll x) {
  return 1LL * (1 + x) * x % MOD * inv2 % MOD;
}

ll S1(ll x, ll y) {
  return S1(y) - S1(x - 1);
}

ll S2(ll x) {
  return 1LL * inv6 * x % MOD * (x + 1) % MOD * (2 * x + 1) % MOD;
}

ll S2(ll x, ll y) {
  return S2(y) - S2(x - 1);
}

int main() {
  // freopen("1.in", "r", stdin);
  
  ll n = read();

  ll L = n / 2 + 1;
  ll R = n;

  // p*p
  // ll res = (solve(R) - solve(L - 1) + MOD) % MOD;
  auto [x, y] = solve(R);
  auto [_x, _y] = solve(L - 1);


  ll sp = (x - _x + MOD) % MOD;
  ll sp2 = (y - _y + MOD) % MOD;

  // cout << "L, R, sp, sp2: " << L << ' ' << R  << ' ' << sp << ' ' << sp2 << '\n';
  ll s = (S1(2, n) - sp + MOD) % MOD;

  ll ans = s * s % MOD;

  ll r = (S2(2, n) - sp2 + MOD) % MOD;

  ans = (ans - r + MOD) % MOD * inv2 % MOD;

  ans = (ans + MOD) % MOD;
  printf("%lld\n", ans); 
  return 0;
}