#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <map>
#include <numeric>
#include <random>
#include <queue>
#include <deque>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <functional>

using namespace std;
typedef long long ll;

const int INF = (1 << 30) - 1;
const ll INFLL= (1LL << 61) - 1;
const int MOD = 1000000007;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

ll ans=0ll;

ll gcd(ll a,ll b){
  if (a%b==0){
    ans+=a/b;
    return(b);
  }
  else{
    ans+=1ll+a/b;
    return(gcd(b,a%b));
  }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int m,n;cin>>m>>n;
  gcd(m,n);
  cout<<ans-1<<endl;
}