#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/boyer_myrvold_planar_test.hpp>
using namespace std;
using namespace boost;

typedef adjacency_list<vecS, vecS, undirectedS> Graph;

int main() {
	int N;
	cin >> N;
	
	Graph G(N+2);
	for (int u = 1; u <= N; ++u)
		add_edge(0, u, G);
	for (int u = 1; u < N; ++u)
		add_edge(u, u+1, G);
	for (int u = 0; u <=N; ++u)
		add_edge(u, N+1, G); 
	cout << boyer_myrvold_planarity_test(G) << "\n";
}