#include #include using namespace std; using mint = atcoder::modint998244353; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector tb(n + 1); vector dp(n + 1, 1); for(int i = 2; i <= n; i++){ if(tb[i]) continue; int d = 1, cnt = 0; while((long long)d * i <= n){ d *= i; cnt += n / d; } for(int j = 1; j <= cnt; j++) dp[j] *= cnt / j + 1; for(int j = 2 * i; j <= n; j += i) tb[j] = true; } cout << accumulate(dp.begin(), dp.end(), mint(-n-1)).val() << '\n'; }