#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


inline ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }


int main() {
    cin >> n;
    ll res = 0;
    for (int i = 1; i < n + 1; i++) {
        res = (res + qmi(n / i, i, MOD)) % MOD;
    }
    printf("%lld\n", res);
    return 0;
}