usaco-Subset Sums

#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define range(i,a,b) for(int i=a;i<=b;++i)
#define LL long long
#define rerange(i,a,b) for(int i=a;i>=b;--i)
#define fill(arr,tmp) memset(arr,tmp,sizeof(arr))
using namespace std;
int n;
LL dp[40][1005];
void init(){
    cin>>n;
    fill(dp,0);
    dp[1][1]=1;
}
void solve(){
    if(!(n%4)||n%4==1){
        cout<<"0"<<endl;
        return;
    }
    range(i,0,n)dp[i][0]=1;
    range(i,2,n)range(j,0,(i+1)*i/2)dp[i][j]=dp[i-1][j]+dp[i-1][j-i];
    cout<<dp[n][(n+1)*n/4]/2<<endl;
}
int main() {
    init();
    solve();
    return 0;
}