#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5, mod = 998244353;
int n;
int f[maxn];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	for(int i = 1; i <= n; ++i)
    {
        for(int j = i; j <= n; j += i)
        {
            f[j]++;
        }
    }
	int s = 0;
	for(int i = 1; i <= n; ++i)
	{
		f[i] = (f[i] + s) % mod;
		s = (s + f[i]) % mod;
	}
	cout << f[n];
	return 0;
}

