#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
std::vector<long long> sieveOfEratosthenes(long long  n = 1000000) {
	std::vector<bool>p(n + 1, true);
	std::vector<long long>ret;
	p[0] = false;
	p[1] = false;
	for (int i = 2; i <= n; ++i) {
		if (!p[i]) continue;
		ret.push_back(i);
		for (int j = 2 * i; j <= n; j += i) p[j] = false;
	}
	return ret;
}
//long long にしているのは p*pとかでこまらないように
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	auto ps = sieveOfEratosthenes(100000);
	/*rep(i, ps.size()) {
		auto p = ps[i];
		if (p < 100)continue;
		for (int q = p - 1; q < 100000; q += p - 1) {
			auto x = pow_mod(q, p, mod);
			if (x%p == 0) {
				cout << q << " " << p << endl;
			}
		}
	}*/
	return 0;
	int x = 124;
	int p = 101;
	int q = 19000;
	cout << q << " " << p << endl;
	auto y = pow_mod(q, p, mod);
	int k;
	if (false) {
		k = gcd(x, y);
		x = pow_mod(x, p - 1, p);
		cout << x << endl;
	}
	else {
		cin >> k;
	}
	if (k % p)cout << 1 << endl;
	else cout << 0 << endl;
	return 0;
}