import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int X, Y;

void main() {
  /*
    321
    4 0
    567
  */
  auto dist = new int[8][8];
  foreach (u; 0 .. 8) {
    dist[u][] = 8;
    dist[u][u] = 0;
  }
  foreach (u; 0 .. 8) {
    const v = (2 - u) & 7;
    chmin(dist[u][v], 1);
  }
  foreach (u; 0 .. 8) {
    const v = (1 - u) & 7;
    chmin(dist[u][v], 1);
  }
  foreach (w; 0 .. 8) foreach (u; 0 .. 8) foreach (v; 0 .. 8) {
    chmin(dist[u][v], dist[u][w] + dist[w][v]);
  }
  debug {
    writeln(dist);
  }
  
  try {
    for (; ; ) {
      X = readInt();
      Y = readInt();
      
      int ans;
      if (X == 0 && Y == 0) {
        ans = 0;
      } else {
        int s;
        if (Y == 0) {
          s = (X > 0) ? 0 : 4;
        } else if (X - Y == 0) {
          s = (X > 0) ? 1 : 5;
        } else if (X == 0) {
          s = (Y > 0) ? 2 : 6;
        } else if (X + Y == 0) {
          s = (Y > 0) ? 3 : 7;
        } else {
          s = -1;
        }
        if (s == -1) {
          ans = -1;
        } else {
          ans = min(dist[s][1], dist[s][5]);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}