#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
string s = "";
long long arr[1000005] = {0};
long long brr[1000005] = {0};
vector<long long> v;
vector<long long> g[1000005];
vector<pair<long long, long long>> p;
vector<pair<long long, long long>> px;
vector<pair<long long, long long>> py;
int main() {
  ios ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n = 0, m = 0, k = 0, q = 0, ans = 0;
  long long x = 0, y = 0, t = 0, sum = 0, sz = 0;
  cin >> x >> y;
  long long z = x + y;
  m = 1;
  n = z;
  for (long long i = 1; i * i <= z; i++) {
    if (z % i == 0) {
      t = z / i;
      p.push_back(make_pair(i, t));
    }
  }
  for (long long i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      t = x / i;
      px.push_back(make_pair(i, t));
    }
  }
  for (long long i = 1; i * i <= y; i++) {
    if (y % i == 0) {
      t = y / i;
      py.push_back(make_pair(i, t));
    }
  }
  reverse(p.begin(), p.end());
  for (int i = 0; i < p.size(); i++) {
    while (1) {
      if (px.back().first > p[i].first) {
        px.pop_back();
      } else {
        break;
      }
    }
    while (1) {
      if (py.back().first > p[i].first) {
        py.pop_back();
      } else {
        break;
      }
    }
    if (p[i].second >= px.back().second) {
      cout << p[i].first + p[i].second + p[i].first + p[i].second << endl;
      return 0;
    }
    if (p[i].second >= py.back().second) {
      cout << p[i].first + p[i].second + p[i].first + p[i].second << endl;
      return 0;
    }
  }
  return 0;
}
