#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll gx, gy;
  cin >> gx >> gy;
  ll ans = 2;
  if (gx == 0 && gy == 0) {
    ans = 0;
  } else if (gx == 0 || gy == 0 || abs(gx) == abs(gy)) {
    ans = 1;
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}