#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
const double PI = 4 * atan(1);
const long long MAX = 9223372036854775807;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
  for (long long i = 2; i <= (int)sqrt(u); i++) {
    if (u % i == 0) return 0;
  }
  return 1;
}
long long mod(long long to_mod, long long MOD) {
  to_mod %= MOD;
  while (to_mod < 0) to_mod += MOD;
  return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b, long long mod) {
  long long res = 0;
  a %= mod;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (2 * a) % mod;
    b >>= 1;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long n, m, x, y, res, t, k, ans = 0, b, q, z, a, l;
long long tabn[14142200];
long long tabm[14142200];
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> m;
  x = n + m;
  tabn[0] = 1e18;
  tabm[0] = 1e18;
  for (int i = 1; i < 14142200; i++) {
    if (n % i == 0)
      tabn[i] = n / i;
    else
      tabn[i] = 1e18;
    if (m % i == 0)
      tabm[i] = m / i;
    else
      tabm[i] = 1e18;
    tabn[i] = min(tabn[i], tabn[i - 1]);
    tabm[i] = min(tabm[i], tabm[i - 1]);
  }
  ans = 1e18;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i) continue;
    if (n <= x / i || m <= x / i || tabn[i] <= x / i || tabm[i] <= x / i)
      ans = min(ans, i + x / i);
  }
  cout << ans * 2;
  return 0;
}
