#include <bits/stdc++.h>

using namespace std;

long long n, mx = 1e9;
int main() {
  //freopen(".inp" , "r" , stdin);
  //freopen(".out" , "w" , stdout);
  cin >> n;
  for (long long a = 1; a <= sqrt(n); ++a)
  {
    if (n % a == 0)
    {
      long long b = n / a;
      mx = min(mx , 2 * (a + b));
    }
  }
  cout << mx;
  return 0;
}

#include <iostream>
#include <cmath>
using namespace std;
int main() {
long long n,m=1e9;
cin>>n;
for (long long a=1;a*a<=n;++a)
if (n%a==0)
m=min(m,2*(a+n/a))
cout<<m<<endl;
return 0;
}