Data Center （CodeForces - 1250F ）（思路）

You are developing a project to build a new data center. The data center will be a rectangle with an area of exactly nn square meters. Each side of the data center must be an integer.

Your goal is to minimize the impact of the external environment on the data center. For this reason, you want to minimize the length of the perimeter of the data center (that is, the sum of the lengths of its four sides).

What is the minimum perimeter of a rectangular data center with an area of exactly nn square meters, if the lengths of all its sides must be integers?

Input

The first and only line of the input contains an integer nn (1≤n≤1051≤n≤105), where nn is the area of the data center in square meters.

Output

Print the required minimum perimeter in meters.

Examples

Input

36

Output

24

Input

13

Output

28

Input

1

Output

4

Note

In the first example, the required shape of the data center is 6×66×6 square. Its area is 3636 and the perimeter is 6+6+6+6=246+6+6+6=24.

In the second example, the required shape of the data center is 1×131×13 rectangle. Its area is 1313 and the perimeter is 1+13+1+13=281+13+1+13=28.

In the third example, the required shape of the data center is 1×11×1 square. Its area is 11 and the perimeter is 1+1+1+1=41+1+1+1=4.

题意：这道题意思就是给你一个长方形的面积，让你求出长方形周长的最小值。

思路：一开始，刚看到这道题的我，想着这应该是一个规律题，于是我就在纸上推了好长时间的规律，什么质数的情况下，周长应该怎么算；什么面积的平方根刚好是整数什么什么的。后来推着推着我突然发现，这不是用暴力直接就可以做吗，先设一个边为i，然后用for循环遍历i值，每次更新周长的值，直到找到那个最小的周长值。说到底还是思路不行QAQ

AC代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
const int maxx=0x3f3f3f3f;
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    int cnt=maxx;
    for(int i=1;i*1<=n;i++)
    {
        if(n%i==0)
            {
                int ans=n/i;
                cnt=min(cnt,(ans+i)*2);
            }
    }
    printf("%d\n",cnt);
    return 0;
}