#include <bits/stdc++.h>
using namespace std;
const long long int INF = 2000000000000000000;
vector<int> adj[200002];
vector<int> visited;
vector<int> color;
vector<int> a;
long long int MOD(long long int a, long long int b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
long long int max3(long long int a, long long int b, long long int c) {
  return max(c, max(a, b));
}
long long int min3(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long int logg(long long int a) {
  long long int x = 0;
  while (a > 1) {
    x++;
    a /= 2;
  }
  return x;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int a, b;
  cin >> a >> b;
  long long int sum = 0;
  sum = a + b;
  long long int per = INF;
  set<pair<long long int, long long int>> diva;
  set<pair<long long int, long long int>> divb;
  for (long long int i = 1; i <= (long long int)sqrt(a); i++) {
    if (a % i == 0) {
      diva.insert(make_pair(i, a / i));
    }
  }
  for (long long int i = 1; i <= (long long int)sqrt(b); i++) {
    if (b % i == 0) {
      divb.insert(make_pair(i, b / i));
    }
  }
  for (long long int i = 1; i <= ((long long int)sqrt(sum)); i++) {
    if (sum % i == 0) {
      set<pair<long long int, long long int>>::iterator v =
          diva.upper_bound(make_pair(i, sum / i));
      set<pair<long long int, long long int>>::iterator g =
          divb.upper_bound(make_pair(i, sum / i));
      if (v != diva.begin() && g != divb.begin()) {
        v--;
        g--;
        if ((((*v).first <= i) && ((*v).second <= sum / i)) ||
            (((*g).first <= i) && ((*g).second <= sum / i))) {
          long long int temp = sum / i + i;
          temp = 2 * temp;
          if (temp < per) {
            per = temp;
          }
        }
      }
    }
  }
  cout << per;
}
