/* -*- coding: utf-8 -*-
 *
 * 2940.cc:  No.2940 Sigma Sigma Div Floor Problem - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 1200000;
const int MOD = 998244353;

/* typedef */

using ll = long long;

/* global variables */

int cs[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j += i) cs[j]++;
  for (int i = 1; i <= n; i++) cs[i] += cs[i - 1];

  int sum = 0;
  for (int i = 1; i <= n; i++)
    sum = (sum + cs[i]) % MOD;

  printf("%d\n", sum);
  
  return 0;
}