#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <limits>
#include <algorithm>
#include <iterator>
#include <memory.h>
#include <time.h>

using namespace std;

typedef unsigned long long ULL;
typedef long long LL;

#define CUR_NAMESPACE namespace subsetz {
CUR_NAMESPACE

class Solver
{
private:
	long long dp[1600];
public:
	void Solve()
	{
		int n;
		scanf("%d", &n);
		int sum = (n + 1) * n / 2;
		if (sum & 1) {
			printf("0\n");
		}
		else {
			int cap = sum >> 1;
			for (int i = 1; i <= n; i++) dp[0] = 1;
			dp[1] = 1;
			for (int i = 2; i <= n; i++) {
				for (int c = cap; c >= i; c--) {
					dp[c] += dp[c - i];
				}
			}
			printf("%d\n", dp[cap] / 2);
		}
	}
} solver;

void Launch()
{
	solver.Solve();
}

#define NAMESPACE_END }
NAMESPACE_END

int main()
{
    freopen("subsetz.in", "r", stdin);
	freopen("subsetz.out", "w+", stdout);
	subsetz::Launch();
	return 0;
}