import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons;
import std.math, std.numeric;

void main() {
    long n, x; scan(n, x);
    if (x > n - x) {
        x = n - x;
    }

    if (x == n - x) {
        writeln(3*x);
        return;
    }

    long ans = n + 2*x;

    void dfs(long x, long y) {
        if (x % y == 0) {
            ans += (x / y) * 2 * y - 1;
            return;
        }
        else {
            ans += (x / y) * 2 * y;
            dfs(y, x % y);
        }
    }

    if (x > n - 2*x) {
        dfs(x, n - 2*x);
    }
    else {
        dfs(n - 2*x, x);
    }

    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
