#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
void solve() {
  long long int a, b;
  cin >> a >> b;
  vector<long long int> diva, divb;
  for (long long int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      diva.push_back(i);
      if (i != a / i) diva.push_back(a / i);
    }
  }
  for (long long int i = 1; i * i <= b; i++) {
    if (b % i == 0) {
      divb.push_back(i);
      if (i != b / i) divb.push_back(b / i);
    }
  }
  sort(diva.begin(), diva.end());
  sort(divb.begin(), divb.end());
  long long int ans = 2 * (a + b) + 2;
  for (long long int i = 1; i * i <= a + b; i++) {
    if ((a + b) % i) continue;
    long long int rows = i;
    long long int cols = (a + b) / i;
    long long int l =
        upper_bound(diva.begin(), diva.end(), cols) - diva.begin() - 1;
    if (l >= 0 and a / diva[l] <= rows) {
      ans = min(ans, 2 * rows + 2 * cols);
      continue;
    }
    l = upper_bound(diva.begin(), diva.end(), rows) - diva.begin() - 1;
    if (l >= 0 and a / diva[l] <= cols) {
      ans = min(ans, 2 * rows + 2 * cols);
      continue;
    }
    l = upper_bound(divb.begin(), divb.end(), cols) - divb.begin() - 1;
    if (l >= 0 and b / divb[l] <= rows) {
      ans = min(ans, 2 * rows + 2 * cols);
      continue;
    }
    l = upper_bound(divb.begin(), divb.end(), rows) - divb.begin() - 1;
    if (l >= 0 and b / divb[l] <= cols) {
      ans = min(ans, 2 * rows + 2 * cols);
      continue;
    }
  }
  cout << ans << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
