#include <atcoder/math>
#include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  if (n > 10'000'000)
    return;
  mint ans = 0;
  for (ll j = 1; j <= n; j++) {
    ans += atcoder::floor_sum(n + 1, j, 1, 0);
    ans -= atcoder::floor_sum(j, j, 1, 0);
  }
  cout << ans.val() << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}