#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for (int i = a; i < b; i++)
#define trav(a,b) for (auto a : b)
#define lld long long
using i64 = long long;
#define all(x) begin(x),end(x)
int DP[501][501*501];

int per[20];
int comb(int n){
	return (n*(n-1))/2;
}
void solve() {
	int n;
	cin>>n;
	int k;
	cin>>k;
		DP[0][0]=1;
		DP[1][0]=1;
		rep(i,2,n+1){
			int sz=comb(i)+1;

			rep(j,0,sz){
				DP[i][j]=0;
				if(j<=comb(i-1))DP[i][j]=DP[i-1][j];
				if(j-1>=0 && j-1<=comb(i-2))DP[i][j]+=DP[i-2][j-1];
				if(j-2>=0){
					DP[i][j]+=DP[i][j-2];
					if(j-2>=0 && j-2<=comb(i-1)){
						DP[i][j]-=DP[i-1][j-2];
					}
					if(j-2*i+1>=0 && j-2*i+1<=comb(i-2)){
						DP[i][j]-=DP[i-2][j-2*i+1];
					}
				}
				DP[i][j]%=2;
				DP[i][j]+=2;
				DP[i][j]%=2;
				
				//~ rep(l,0,i-1){
					//~ if(j-2*l-1>=0 && j-2*l-1<=comb(i-2)){
						//~ DP[i][j]+=DP[i-2][j-2*l-1];
					//~ }
				//~ }
			}
		}
		//~ rep(i,0,n+1){
			//~ rep(j,0,comb(i)+1)cout<<DP[i][j]<<" ";
			//~ cout<<endl;
		//~ }
		cout<<DP[n][k]%2<<"\n";
		
		//~ int cnt=0;
		//~ rep(i,0,n)per[i]=i;
		//~ do{
			//~ bool is_inv=true;
			//~ rep(i,0,n){
				//~ if(per[per[i]]!=i)is_inv=false;
			//~ }
			//~ if(is_inv){
				//~ int inv=0;
				//~ rep(i,0,n){
					//~ rep(j,i+1,n){
						//~ if(per[i]>per[j])inv++;
					//~ }
				//~ }
				//~ if(inv==k)cnt++;
			//~ }
		//~ }while(next_permutation(per,per+n));
		//~ cout<<cnt<<endl;
		//~ if(DP[n][k]!=cnt)cout<<"ERR\n";
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	//~ cin >> tt;
	while (tt--) solve();
	return 0;
}