#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int solve(ll n, ll p){
	if(n==0){
		return 1;
	}
	if(n==2){
		if(p%8==1 || p%8==7) return 1;
		else return -1;
	}
	int ret=1;
	while(n%2==0){
		n/=2;
		ret*=solve(2, p);
	}
	ll x=p%n;
	ret*=solve(x, n);
	if(n%4==3 && p%4==3) ret*=(-1);
	return ret;
}
int main()
{
	ll p, n;
	cin>>p>>n;
	if(p==2){
		cout<<0<<endl;
		return 0;
	}
	if(solve(n, p)==1) cout<<0<<endl;
	else cout<<1<<endl;
	return 0;
}