#include <bits/stdc++.h>
using namespace std;
long long int INF = 1e18;
long long int mod = 1000000007;
double Pi = 3.1415926535897932384626;
vector<long long> G[500005];
vector<pair<long long, long long> > tree[500010];
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    pqps;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
long long bit[500005];
long long rui(long long abc, long long bed) {
  if (bed == 0) {
    return 1;
  } else {
    long long ced = rui(abc, bed / 2);
    ced *= ced;
    ced %= mod;
    if (bed % 2 == 1) {
      ced *= abc;
      ced %= mod;
    }
    return ced;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
long long i, j, k, ii, jj, r, l;
long long n, num, sum;
double ans;
long long a, b, c, d, e, g, h;
long long dp1[1050000], dp2[1050000];
double x[500005], w[500005];
long long bitsum(long long i) {
  long long s = 0;
  while (i > 0) {
    s += bit[i];
    i -= i & -i;
  }
  return s;
}
void bitadd(long long b, long long x) {
  while (b <= n) {
    bit[b] += x;
    b += b & -b;
  }
}
void solve(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 1) {
    ans += 2 * a - 1;
    return;
  } else {
    ans += (a / b) * b * 2;
    solve(b, a % b);
  }
}
int main() {
  cin >> n >> k;
  ans = n;
  solve(k, n - k);
  cout << ans << endl;
  ;
  return 0;
}
