#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;

int ans;
int X,Y;
int main(){
    ans = -1;
    cin>>X>>Y;
    if(X==Y) ans=0;
    else if(Y==0) ans=1;
    else if(X==0) ans=2;
    else if(X==-Y) ans=3;
    p(ans);
    return 0;
}