#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 500;
const long long mod = 1e9 + 7;
const long long cmod = 998244353;
const long long inf = 1LL << 61;
const int M = 1e6 + 500;
const int NN = 5e3 + 6;
long long int x1[M], x2[M], x3[M];
long long int idx1, idx2, idx3;
void solve() {
  long long int a, b;
  cin >> a >> b;
  for (long long int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      x1[idx1++] = i;
    }
  }
  for (long long int i = 1; i * i <= b; i++) {
    if (b % i == 0) {
      x3[idx3++] = i;
    }
  }
  long long int x = a + b;
  long long int ans = inf;
  for (long long int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      x2[idx2++] = i;
    }
  }
  for (int i = 0; i < idx2; i++) {
    for (int j = 0; j < idx1; j++) {
      long long int X1, X2, Y1, Y2;
      X1 = x1[j];
      X2 = x2[i];
      if (X1 == 0 || X2 == 0) break;
      Y1 = a / X1;
      Y2 = x / X2;
      if (X1 > Y1) swap(X1, Y1);
      if (X2 > Y2) swap(X2, Y2);
      if (X2 >= X1 && Y2 >= Y1) {
        ans = min(ans, 2 * (X2 + Y2));
      }
    }
    for (int j = 0; j < idx3; j++) {
      long long int X1, X2, Y1, Y2;
      X1 = x3[j];
      X2 = x2[i];
      if (X1 == 0 || X2 == 0) break;
      Y1 = b / X1;
      Y2 = x / X2;
      if (X1 > Y1) swap(X1, Y1);
      if (X2 > Y2) swap(X2, Y2);
      if (X2 >= X1 && Y2 >= Y1) {
        ans = min(ans, 2 * (X2 + Y2));
      }
    }
  }
  cout << ans;
  cout << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
