CodeForces - 1029F

There is an infinite board of square tiles. Initially all tiles are white.

Vova has a red marker and a blue marker. Red marker can color a tiles. Blue marker can color b tiles. If some tile isn't white then you can't use marker of any color on it. Each marker must be drained completely, so at the end there should be exactly a red tiles and exactly b blue tiles across the board.

Vova wants to color such a set of tiles that:

• they would form a rectangle, consisting of exactly a+b colored tiles;
• all tiles of at least one color would also form a rectangle.

Here are some examples of correct colorings:

Here are some examples of incorrect colorings:

Among all correct colorings Vova wants to choose the one with the minimal perimeter. What is the minimal perimeter Vova can obtain?

It is guaranteed that there exists at least one correct coloring.

Input

A single line contains two integers a and b () — the number of tiles red marker should color and the number of tiles blue marker should color, respectively.

Output

Print a single integer — the minimal perimeter of a colored rectangle Vova can obtain by coloring exactly a tiles red and exactly b tiles blue.

It is guaranteed that there exists at least one correct coloring.

Examples

Input

4 4

Output

12

Input

3 9

Output

14

Input

9 3

Output

14

Input

3 6

Output

12

Input

506 2708

Output

3218

Note

The first four examples correspond to the first picture of the statement.

Note that for there exist multiple correct colorings for all of the examples.

In the first example you can also make a rectangle with sides 1 and 8, though its perimeter will be 18 which is greater than 8.

In the second example you can make the same resulting rectangle with sides 3 and 4, but red tiles will form the rectangle with sides 1 and 3 and blue tiles will form the rectangle with sides 3 and 3.

题目大意：

       有a个红瓷砖，b个蓝瓷砖，要使得这些瓷砖组成一个完整的矩形，同时要保证a个红瓷砖或b个蓝瓷砖能够组成一个完整的矩阵（其中一种颜色的瓷砖满足即可），问你能够构成的这么多方案数中，构造出的完整的矩形的最小的周长为多少。

代码中解释：

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define MOD 1e9+7
#define LL long long
#define ULL unsigned long long     //1844674407370955161
#define INT_INF 0x7f7f7f7f      //2139062143
#define LL_INF 0x7f7f7f7f7f7f7f7f //9187201950435737471
const int dr[]={0, 0, -1, 1, -1, -1, 1, 1};
const int dc[]={-1, 1, 0, 0, -1, 1, -1, 1};
// ios::sync_with_stdio(false);
// 那么cin, 就不能跟C的 scanf，sscanf, getchar, fgets之类的一起使用了。
int main()
{
    LL a,b;
    cin>>a>>b;
    LL cnt=a+b;
    LL ans=LL_INF;
    LL width=LL_INF;
    for(LL x=1 ; x*x<=cnt ; ++x)
    {
        if(a%x==0)//寻找两种瓷砖最小的矩形边长
            width=min(width,a/x);
        if(b%x==0)
            width=min(width,b/x);
        if(cnt%x==0)
        {
            LL y=cnt/x;
            if(width<=y)//存在单一颜色小矩形在大矩形里面
            {
                LL temp=2*(x+y);
                ans=min(ans,temp);//计算最小的周长
            }
        }
    }
    printf("%lld\n",ans);
    return 0;
}