#include <cstdio>
#include <cstdint>
#include <algorithm>

int gcd(int m, int n) {
  while (n) std::swap(m %= n, n);
  return m;
}

int main() {
  int N, M;
  scanf("%d %d", &N, &M);

  int g = gcd(M, N);
  M /= g;
  N /= g;

  int res = 0;
  if (N < M) {
    std::swap(M, N);
    ++res;
  }
  while (N > 1) {
    if (M < N) {
      std::swap(M, N);
      continue;
    }
    res += M/N + 1;
    std::swap(M %= N, N);
  }
  printf("%d\n", res+M-1);
}