51nod 1283 最小周长

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include <cmath>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
vector<int>vec;
vector<int>vec1;
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i*i<=n;i++){
        if(n%i==0){
            vec.push_back(i);
        }
    }
    int cnt=0;
    for(int i=0;i<vec.size();i++){
        vec1.push_back((vec[i]+(n/vec[i])));
    }
    sort(vec1.begin(),vec1.end());
    cout<<2*vec1[0]<<endl;
    return 0;
}