#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int m,n; 
int res = 1145141919810;
void solve(int m, int n, int ans){
    int prem=m, pren = n;
    if(n == m) chmin(res, ans);
    if(n<=0 || m<= 0) return ;
    int x = (m-1)/n;
    m -= n*x;
    ans += x;
    if(prem == m && pren == n) return ;
    solve(m, n, ans);
    solve(n, m, ans + 1);
}
signed main(void){
    cin>>m>>n;
    solve(m, n, 0);
    solve(n, m, 1);
    cout<<res<<endl;
}