#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return (power(x, y / 2) * power(x, y / 2)) % 998244353;
  else
    return ((x * power(x, y / 2)) % 998244353 * power(x, y / 2)) % 998244353;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long modInverse(long long n, long long p) { return power(n, p - 2, p); }
long long fac[100000 + 1];
void pre(long long p) {
  fac[0] = 1;
  for (long long i = 1; i <= 100000; i++) fac[i] = (fac[i - 1] * i) % p;
}
long long nCrModPFermat(long long n, long long r, long long p) {
  if (r == 0) return 1;
  if (r > n) return 0;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long a, b, s, e, i;
  cin >> a >> b;
  long long mid;
  long long ans = 1e16;
  vector<long long> v;
  for (i = 1; i * i <= (a + b); i++) {
    if ((a + b) % i == 0) {
      v.push_back(i);
    }
  }
  vector<long long> aa, bb;
  for (i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      aa.push_back(i);
    }
  }
  for (i = 1; i * i <= b; i++) {
    if (b % i == 0) {
      bb.push_back(i);
    }
  }
  for (auto it : v) {
    s = 0;
    e = aa.size() - 1;
    long long x = -1;
    while (s <= e) {
      mid = (s + e) / 2;
      if (aa[mid] <= it) {
        s = mid + 1;
        x = aa[mid];
      } else
        e = mid - 1;
    }
    if (x != -1) {
      if (a / x <= (a + b) / it) {
        ans = min(ans, it + (a + b) / it);
      }
    }
    s = 0;
    e = bb.size() - 1;
    x = -1;
    while (s <= e) {
      mid = (s + e) / 2;
      if (bb[mid] <= it) {
        s = mid + 1;
        x = bb[mid];
      } else
        e = mid - 1;
    }
    if (x != -1) {
      if (b / x <= (a + b) / it) {
        ans = min(ans, it + (a + b) / it);
      }
    }
  }
  cout << 2 * ans;
  cerr << (1000 * clock()) / CLOCKS_PER_SEC << "ms";
  return 0;
}
