#include<iostream>
#include<cstdio>
#include<vector>
#define N 3000
#define mod 998244353
using namespace std;
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int n,pw2[N+1],dp[N+1],DP[N+1],delta[N+1],miu[N+1];
bool nprime[N+1];
int fast_pow(int a,long long b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int main()
{
	n=read(),pw2[0]=1;
	for (int i=1;i<=n;++i) pw2[i]=2ll*pw2[i-1]%mod;
	for (int i=1;i<=n;++i) miu[i]=1;
	for (int i=2;i<=n;++i)
		if (!nprime[i])
		{
			miu[i]=-1;
			for (int j=(i<<1);j<=n;j+=i)
			{
				miu[j]=-miu[j],nprime[j]=1;
				if ((j/i)%i==0) miu[j]=0;
			}
		}
	for (int i=1;i<=n;++i)
		for (int j=2;j<=i;++j)
		{
			if (miu[j]==-1) Adder(delta[i],MD2(pw2[i/j]-1));
			else if (miu[j]==1) Adder2(delta[i],-MD2(pw2[i/j]-1));
		}
	for (int i=1;i<=n;++i)
	{
		Adder(dp[i],pw2[i-1]),Adder(DP[i],MD2(dp[i]-1));
		for (int j=1;j<=n/i-1;++j)
			for (int k=i*(j+1);k<=min((i+1)*(j+1)-1,n);++k)
			{
				Adder(dp[k],DP[i]);
				Adder(dp[k],1ll*MD2(pw2[(j-1)>>1]-1)*MD2(2ll*MD(dp[i]+DP[i])%mod-1)%mod);
				if (miu[j+1]==1) Adder(DP[k],MD2(3ll*dp[i]%mod-2));
				else if (miu[j+1]==-1) Adder2(DP[k],-MD2(3ll*dp[i]%mod-2));
			}
	}
	printf("%d\n",dp[n]);
	return 0;
}