1 #include <cstdio>

 2 #include <cstring>

 3 #include <algorithm>

 4 #include <string>

 5 #include <vector>

 6 #include <map>

 7 #include <cmath>

 8 #include <iostream>

 9 using namespace std;

10 typedef long long ll;

11 const int maxn = 1e6 + 10;

12 int n;

13 int na[maxn];

14 int main()

15 {

16     ll a, b;

17     scanf("%lld %lld", &a, &b);

18     ll sum = a + b;

19     ll ans = 2 * (a + b + 1);

20     ll minn = a + b;

21     for(ll i = 1; i * i <= sum; ++i)

22     {

23         if(a % i == 0)  minn = min(minn, a / i);

24         if(b % i == 0)  minn = min(minn, b / i);//minn就是用来找到那个能放进去的小矩形

25         if((a + b) % i == 0 && minn <= (a + b) / i) ans = min(ans, 2 * ((a + b) / i + i));//维护合理的大矩形周长

26     }

27     printf("%lld\n", ans);

28     return 0;

29 }