#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353;
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)res=1ll*res*x%m;x=1ll*x*x%m;}
	return res;
}
inline void Ad(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
inline void Mi(int &x,int y){x=x-y<0?x-y+mod:x-y;}
const int N=200;
int n,iv[N],fac[N],inv[N];
int a[N],tt;
int res;
inline void ck(){
	int ans=fac[n];
	rep(i,1,tt)rep(j,1,a[i]){
		int c=a[i]-j+1;
		rep(k,i+1,tt)c+=a[k]>=j;
		ans=1ll*ans*iv[c]%mod;
	}
	Ad(res,1ll*ans*ans%mod);
}
inline void dfs(int x,int p){
	if(x==0){ck();return;}
	++tt;
	rep(i,1,min(p,x)) a[tt]=i,dfs(x-i,i);
	--tt;
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	n=read();
	iv[1]=1;rep(i,2,N-1)iv[i]=1ll*iv[mod%i]*(mod-mod/i)%mod;
	fac[0]=inv[0]=1;rep(i,1,N-1)fac[i]=1ll*fac[i-1]*i%mod,inv[i]=fp(fac[i]);
	tt=2;
	rep(i,1,n>>1){
		a[1]=a[2]=i;
		dfs(n-i-i,i);
	}
	cout<<res;
    return 0;
}