1283 最小周长

#include <cstdio>
#include <cmath>
int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {
        int B=n;
        int Q= ceil(sqrt(n*1.0));
        int resert;
        for(int i=Q; i>= 1; i--)
        {
            if(B%i==0 && B/Q <=n)
            {
                resert= i;
                break;
            }
        }
        printf("%d\n", resert*2+(B/resert)*2);
    }
    return 0;
}