#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,  g[10004];
const ll mod = 1000000000000000000;
ll f[5][20004], maxn;
//i树 达到j的长度的方案数
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	if (n == 1) {
		cout << 0;
		return 0;
	} else if (n >= 2 && n < 6) {
		cout << 1;
		return 0;
	} else if (n == 6) {
		cout << 3;
		return 0;
	}
	g[1] = 0, g[2] = 1;
	int u, v;
	for (int i = 3; i <= n; i++) {
		g[i] = (g[i - 1] + 1) ^ (g[i - 2] + 1);
	}
	f[2][0] = 1;
	int p, q, w;
	for (int i = 3; i <= n; i++) {
		p = i % 3, q = (i - 1) % 3, w = (i - 2) % 3;
		memset(f[p], 0, sizeof(f[p]));
		for (int j = 0; j <= 8192; j++) {
			if (((j + 1) ^ (g[i - 2] + 1)) <= 8192) {
				f[p][(j + 1) ^ (g[i - 2] + 1)] += f[q][j];
//				if (f[q][j]) {
//					cout << ((j + 1) ^ (g[i - 2] + 1)) << " " << f[q][j] << "[]\n";
//				}
				f[p][(j + 1) ^ (g[i - 2] + 1)] %= mod;
			}
		}
		for (int j = 0; j <= 8192; j++) {
			if (((j + 1) ^ (g[i - 1] + 1)) <= 8192) {
				f[p][(j + 1) ^ (g[i - 1] + 1)] += f[w][j];
//				if (f[w][j]) {
//					cout << ((j + 1) ^ (g[i - 1] + 1)) << " " << f[w][j] << "[]\n";
//				}
				f[p][(j + 1) ^ (g[i - 1] + 1)] %= mod;
			}
		}
		f[p][g[i - 1] + 1]++, f[p][g[i - 2] + 1]++;
	}
	cout << f[n % 3][0];
}