#include <bits/stdc++.h>
using namespace std;
struct hash_pair {
  template <class T1, class T2>
  size_t operator()(const pair<T1, T2> &p) const {
    auto hash1 = hash<T1>{}(p.first);
    auto hash2 = hash<T2>{}(p.second);
    return hash1 ^ hash2;
  }
};
bool prime[10000001];
long long P = 1000000007 - 2;
long long factorial[10000001] = {0};
long long powerFunction(long long x, long long y) {
  long long res = 1;
  long long p = 1000000007;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void sieveFunction(long long maxLimit) {
  memset(prime, true, sizeof(prime));
  prime[0] = prime[1] = false;
  for (long long i = 2; maxLimit >= i; i++) {
    if (prime[i]) {
      for (long long j = 2 * i; maxLimit >= j; j += i) prime[j] = false;
    }
  }
}
void factorialFunction(long long maxLimit) {
  factorial[0] = 1;
  for (long long i = 1; i <= maxLimit; i++)
    factorial[i] = (factorial[i - 1] * i) % 1000000007;
  return;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void fun(long long num, vector<long long> &v) {
  for (long long i = 1; num >= i * i; i++) {
    if (num % i == 0) {
      v.push_back(i);
      if (i != num / i) {
        v.push_back(num / i);
      }
    }
  }
}
long long fac(long long num, vector<long long> &v, long long x) {
  auto it = lower_bound(v.begin(), v.end(), x);
  if ((*it) == x) {
    return x;
  }
  it--;
  return (*it);
}
void prin(vector<long long> &v) {
  for (long long i = 0; v.size() > i; i++) {
    cout << v[i] << ' ';
  }
  cout << "\n";
}
signed main() {
  long long a, b;
  cin >> a >> b;
  vector<long long> va, vb;
  fun(a, va);
  fun(b, vb);
  sort(va.begin(), va.end());
  sort(vb.begin(), vb.end());
  long long ans = INT64_MAX;
  for (long long i = 1; (a + b) >= i * i; i++) {
    if ((a + b) % i == 0) {
      long long j = (a + b) / i;
      if (a / fac(a, va, i) <= j || a / fac(a, va, j) <= i ||
          b / fac(b, vb, i) <= j || b / fac(b, vb, j) <= i) {
        ans = min(ans, 2 * (i + j));
      }
    }
  }
  cout << ans << "\n";
}
