#include <iostream>
#include <algorithm>
using namespace std;
int solve(int P, int N) {
	if (P == 2) return 0;
	int B = 0;
	while (B * B < P) ++B;
	int pos = 0;
	for (int i = 1; i <= B; ++i) {
		int val = 1LL * i * N % P;
		if (val <= B) {
			pos = i;
			break;
		}
		else if (val >= P - B) {
			return solve(P, P - N) ^ (1LL * N * (N - 1) / 2);
		}
	}
	if (pos == -1) return -1;
	int delta = 1LL * pos * N % P;
	int ans = 0;
	for (int i = 0; i < pos; ++i) {
		long long ini = 1LL * i * N % P;
		for (int j = 0; j < 2; ++j) {
			long long L = 1LL * j * P + (P + 1) / 2, R = 1LL * j * P + P;
			long long pl = max(L - ini + P - 1, 0LL) / P, pr = max(R - ini + P - 1, 0LL);
			if (pl >= (P + 1) / 2) pl = (P + 1) / 2;
			if (pr >= (P + 1) / 2) pr = (P + 1) / 2;
			ans += pr - pl;
		}
	}
	return ans % 2;
}
int main() {
	int P, N;
	cin >> P >> N;
	int ans = solve(P, N);
	cout << ans << endl;
	return 0;
}