#include <bits/stdc++.h>
typedef long long int ll;
#define int   long long int
ll mod=998244353;

using namespace std;

/*ll fun(ll n,vector<ll> &arr,int fac[])
{
    
    if(arr[n]!=-1)
        return arr[n];
    ll ans=fac[n/2];
    /*for(int i=2;i<n;i+=2)
        ans=(ans+fun(i,arr,fac))%m;
    return arr[n]=ans%mod;
    

}
*/
int factor(int n)
{
    int s=0;
    for(int i=1;i*i<=n;i++)
    {
        if(n%i==0)
        {
            s++;
            if(n/i!=i)
                s++;
        }
    }
    return s;
}
signed main() {

    
    #ifndef ONLINE_JUDGE

freopen("input.txt", "r", stdin);

freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);

#endif // ONLINE_JUDGE
int n;
cin>>n;
int m=2*n+1;
int fac[m];
for(int i=0;i<m;i++)
fac[i]=1;
for(int i=2;i<=m/2;i++)
{
    if(fac[i]==1)
    {
        fac[i]=2;
        for(int j=2*i;j<m;j+=i)
        {
            int sum=1;
            int k=j;
            while(k%i==0)
            {
                k=k/i;
                sum++;
            }
            fac[j]=fac[j]*sum;
        }
    }
}


vector<ll> arr;
for(int i=0;i<2*n+2;i++)
    arr.push_back(-1);

ll sum=0;
arr[2]=1;
sum=arr[2];
for(int i=4;i<=2*n;i+=2)
{
    //cout<<sum<<fac[2]<<endl;
    if(fac[i/2]==1)
        fac[i/2]++;
    arr[i]=(sum+fac[i/2])%mod;
    sum=(sum+arr[i])%mod;
}

cout<<arr[2*n]<<endl;

return 0;
}