#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long dp[40][800],n;
int main(){
scanf("%lld",&n);
dp[0][0]=1;
dp[1][1]=1;
int s=(n+1)*n/2;
if(s%2!=0){
cout<<0<<endl;
return 0;
}
for(int i=2;i<=n;i++){
for(int j=0;j<=s;j++){
if(j>i) dp[i][j]=dp[i-1][j]+dp[i-1][j-i];
else dp[i][j]=dp[i-1][j];
}
}
cout<<dp[n][(1+n)*n/4];
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long dp[40][800],n;
int main(){
scanf("%lld",&n);
dp[0][0]=1;
dp[1][1]=1;
int s=(n+1)*n/2;
if(s%2!=0){
cout<<0<<endl;
return 0;
}
for(int i=2;i<=n;i++){
for(int j=0;j<=s;j++){
if(j>i) dp[i][j]=dp[i-1][j]+dp[i-1][j-i];
else dp[i][j]=dp[i-1][j];
}
}
cout<<dp[n][(1+n)*n/4];
return 0;
}