#include<bits/stdc++.h> // #define int long long using namespace std; const int N=1e4+7,mod=998244353; int n,dp[3][(1<<13)+7],f[N]; inline int Add(int &a,int b){ a+=b;(a>=mod?a-=mod:a); } signed main(){ #ifndef ONLINE_JUDGE freopen("fibgame.in","r",stdin); freopen("fibgame.out","w",stdout); #endif cin>>n;int V=0; f[1]=0,f[2]=1; for(int i=3;i<=n;i++)f[i]=(f[i-1]+1)^(f[i-2]+1),V=max(V,f[i]); dp[2][0]=1; for(int i=3;i<=n;i++){ int t=i%3; memset(dp[t],0,sizeof(dp[t])); for(int j=0;j<=V;j++){ Add(dp[t][j],(j==(f[i-2]+1)?1:dp[(i+2)%3][(j^(f[i-2]+1))-1])); Add(dp[t][j],(j==(f[i-1]+1)?1:dp[(i+1)%3][(j^(f[i-1]+1))-1])); } }cout<<dp[n%3][0]<<endl;return 0; }