#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
const int N = 1000100;
ll fac[N], invfac[N];

ll modpow(ll a, ll b, ll MOD){
	ll ret = 1;
	while (b > 0){
		if(b & 1){
			ret *= a;
			ret %= MOD;
		}
		a *= a;
		a %= MOD;
		b >>= 1;
	}
	return ret;
}

void init(){
	fac[0] = 1;
	for(int i = 1; i < N; i++) fac[i] = fac[i - 1] * i % MOD;
	invfac[N - 1] = modpow(fac[N - 1], MOD - 2, MOD);
	for(int i = N - 2; i >= 0; i--) invfac[i] = invfac[i + 1] * (i + 1) % MOD;
}

ll nCk(int n, int k){
	if(k < 0 || k > n) return 0;
	else return (fac[n] * invfac[k] % MOD) * invfac[n - k] % MOD;
}

void solve(){
	ll n, k;
	cin >> n >> k;
	ll d = n * (n + 1) / 2 - k;
	set<ll> se;
	se.insert(0);
	ll cum = 0;
	for(ll i = 1; i <= n; i++){
		cum += i;
		if(se.count(cum - d)){
			cout << 1 << endl;
			return;
		}
		se.insert(cum);
	}
	cout << 2 << endl;
}

int main(){
	solve();
}