#include <bits/stdc++.h>
using namespace std;
bool predfunc(vector<long long> afac, long long len, long long bread,
              long long a, long long n) {
  for (long long i = 0; i < n; i++) {
    {
      if (afac[i] <= len && (a / afac[i]) <= bread) return true;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long a, b;
  cin >> a >> b;
  long long area = a + b;
  vector<long long> areafac, afac, bfac;
  for (long long i = 1; i * i <= area; i++)
    if (area % i == 0) areafac.push_back(i);
  for (long long i = 1; i * i <= a; i++)
    if (a % i == 0) afac.push_back(i);
  for (long long i = 1; i * i <= b; i++)
    if (b % i == 0) bfac.push_back(i);
  long long loa = 0, arsize = areafac.size(), asize = afac.size(),
            bsize = bfac.size();
  long long hia = arsize - 1, mida;
  for (long long i = hia; i >= 0; i--) {
    if (predfunc(afac, areafac[i], area / areafac[i], a, asize)) {
      loa = i;
      break;
    }
  }
  if (predfunc(afac, areafac[arsize - 1], area / areafac[arsize - 1], a,
               asize)) {
    cout << 2 * (areafac[arsize - 1] + area / areafac[arsize - 1]);
    return 0;
  }
  long long peria = 2 * (areafac[loa] + area / areafac[loa]);
  long long lob = 0, hib = arsize - 1, midb;
  for (long long i = hib; i >= 0; i--) {
    if (predfunc(bfac, areafac[i], area / areafac[i], b, bsize)) {
      lob = i;
      break;
    }
  }
  if (predfunc(bfac, areafac[arsize - 1], area / areafac[arsize - 1], b,
               bsize)) {
    cout << 2 * (areafac[arsize - 1] + area / areafac[arsize - 1]);
    return 0;
  }
  long long perib = 2 * (areafac[lob] + area / areafac[lob]);
  cout << min(peria, perib);
  return 0;
}
