#include <iostream>
#include <cmath>

const int md = 998244353;

int floor_sqrt(int x) {
    int a = round(sqrt(x) - 0.49);
    while (a * a > x) a--;
    return a;
}

long long floor_sum(long long n, long long m, long long a, long long b) {
    long long ans = 0;
    if (a < 0) {
        ans += n * (n - 1) / 2 * (a / m);
        a %= m;
    }
    if (b < 0) {
        ans += n * (b / m);
        b %= m;
    }
    while (true) {
        if (a >= m) {
            ans += n * (n - 1) / 2 * (a / m);
            a %= m;
        }
        if (b >= m) {
            ans += n * (b / m);
            b %= m;
        }
        long long y_max = a * n + b;
        if (y_max < m) break;
        long long new_n = y_max / m;
        long long new_b = y_max % m;
        long long new_m = a;
        long long new_a = m;
        n = new_n;
        b = new_b;
        m = new_m;
        a = new_a;
    }
    return ans;
}

int main() {
    int n;
    std::cin >> n;
    long long ans = 0;
    int m = n + 1;

    int root = floor_sqrt(n);
    long long s = (long long)n * (n + 1) / 2;
    for (int d = 1; d <= root; d++) {
        long long t = s;
        s = floor_sum(n + 1, d + 1, 1, 0);
        ans += (long long)d * (t - s);
        ans %= md;
    }
    for (int d = 1; d <= n / root; d++) {
        int q = m / d;
        int r = m % d;
        ans += (long long)(root + q) * (q - root - 1) / 2 * d + (long long)r * q;
        ans %= md;
    }
    std::cout << ans << std::endl;
    return 0;
}