#include <bits/stdc++.h>
using namespace std;
vector<long long int> v[100005];
bool vis[100005];
map<pair<long long int, long long int>, long long int> cost;
int lps(string str) {
  int n = str.length();
  if (n < 2) {
    return 0;
  }
  int len = 0;
  int i = n / 2;
  while (i < n) {
    if (str[i] == str[len]) {
      ++len;
      ++i;
    } else {
      if (len == 0) {
        ++i;
      } else {
        --len;
      }
    }
  }
  return len;
}
long long int modular_pow(long long int base, long long int exponent) {
  long long int result = 1;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % 1000000007;
    exponent = exponent >> 1;
    base = (base * base) % 1000000007;
  }
  return result % 1000000007;
}
bool mycmp(pair<long long int, long long int> a,
           pair<long long int, long long int> b) {
  if (a.second < b.second) return true;
  return false;
}
vector<int> prime;
bool isPrime[1000005];
void seive() {
  memset(isPrime, true, sizeof(isPrime));
  isPrime[2] = 1;
  for (int i = 2; i <= 1000000; i++) {
    if (isPrime[i]) {
      prime.push_back(i);
      for (int j = i * 2; j <= 1000000; j += i) isPrime[j] = 0;
    }
  }
}
long long int query(long long int *BIT, long long int index) {
  long long int sum = 0;
  for (; index > 0; index -= index & -index) sum += BIT[index];
  return sum;
}
void update(long long int *BIT, long long int maxval, long long int index,
            long long int val) {
  for (; index <= maxval; index += index & -index) BIT[index] += val;
}
long long int A[2000005];
long long int num(long long int n) {
  long long int ans = 0;
  while (n > 0) ans++, n = n / 10;
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, l, m, n, a, b, h;
  cin >> a >> b;
  long long int pp = a + b;
  long long int ans = 2 * pp + 2;
  if (a == 0 && b == 0) {
    cout << 0;
    return 0;
  }
  long long int mini = LLONG_MAX;
  for (i = 1; i * i <= pp; i++) {
    if (a % i == 0) mini = min(mini, a / i);
    if (b % i == 0) mini = min(mini, b / i);
    if (pp % i == 0) {
      long long int zz = pp / i + i;
      if (mini <= pp / i) ans = min(ans, 2 * zz);
    }
  }
  cout << ans;
}
