#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return (!b) ? a : gcd(b, a % b);
}
int t = 1;
int ti;
long long int a, b;
vector<pair<long long int, long long int> > va, vb, vab;
void solve() {
  cin >> a >> b;
  for (long long int p = 1; p * p <= a; p++) {
    if (a % p == 0) {
      va.push_back({p, a / p});
    }
  }
  for (long long int p = 1; p * p <= b; p++) {
    if (b % p == 0) {
      vb.push_back({p, b / p});
    }
  }
  long long int n = a + b;
  for (long long int p = 1; p * p <= n; p++) {
    if (n % p == 0) {
      vab.push_back({p, n / p});
    }
  }
  long long int ans = 2 * n + 2;
  int l = 0;
  for (int i = 0; i <= (int)vab.size() - 1; i++) {
    long long int x = vab[i].first;
    long long int y = vab[i].second;
    while (l + 1 <= (int)va.size() - 1 && va[l + 1].first <= x) {
      l += 1;
    }
    if (va[l].second <= y) {
      ans = min(ans, 2 * (x + y));
    }
  }
  l = 0;
  for (int i = 0; i <= (int)vab.size() - 1; i++) {
    long long int x = vab[i].first;
    long long int y = vab[i].second;
    while (l + 1 <= (int)vb.size() - 1 && vb[l + 1].first <= x) {
      l += 1;
    }
    if (vb[l].second <= y) {
      ans = min(ans, 2 * (x + y));
    }
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}
