#include <iostream>
#include <map>
using namespace std;
int m=1000000000;
map <int,map<int,bool> >dp;
int tmp(int x,int y){
        if(y==0)
                return 0;
        return x%y;
}
int recursion(int x,int y,int counter){
        if(x==y){
                if(m>counter)
                        m=counter;
                return true;
        }
        if(dp[x][y])return true;
        dp[x][y]=true;
        recursion(y,x,counter+1);
        recursion(x+y,x-y,counter+1);
        return false;
}
int main(){
        int x,y;
        cin >> x >> y;
        if(x==y){
                cout<<0<<endl;
                return 0;
        }
        if(tmp(x,y)==0 || tmp(y,x)==0){
                recursion(x,y,0);
                if(m==1000000000)
                        cout<<-1<<endl;
                else
                        cout<<m<<endl;
        }
        else
                cout<<-1<<endl;
        return 0;
}