func_code_string: #include <bits/stdc++.h>   using namespace std;   int n;   vector<pair<long long, long long> > a;   set<int> extr;   set<int>::iterator it;   vector<int> e;   int f[300005];   long long mnx = 999999999999999999, mny = 999999999999999999,             mxx = -999999999999999999, mxy = -999999999999999999;   int main() {     cin >> n;     a.reserve(n);     for (int i = 0; i < n; i++) {       long long x, y;       cin >> x >> y;       a.push_back({x, y});     }     long long m = 0;     for (int i = 0; i < n; i++) {       if (a[i].first <= a[m].first) {         m = i;         mnx = a[m].first;       }     }     extr.insert(m);     f[m] = 1;     m = 0;     for (int i = 0; i < n; i++) {       if (a[i].second <= a[m].second) {         m = i;         mny = a[m].second;       }     }     extr.insert(m);     f[m] = 1;     m = 0;     for (int i = 0; i < n; i++) {       if (a[i].first >= a[m].first) {         m = i;         mxx = a[m].first;       }     }     extr.insert(m);     f[m] = 1;     m = 0;     for (int i = 0; i < n; i++) {       if (a[i].second >= a[m].second) {         m = i;         mxy = a[m].second;       }     }     extr.insert(m);     f[m] = 1;     for (it = extr.begin(); it != extr.end(); it++) {       e.push_back(*it);     }     long long p = -999999999999999999;     for (int i = 0; i < e.size(); i++) {       for (int j = i + 1; j < e.size(); j++) {         for (int k = 0; k < n; k++) {           if (k == e[i] || k == e[j]) continue;           long long minx = min(a[e[i]].first, min(a[e[j]].first, a[k].first));           long long maxx = max(a[e[i]].first, max(a[e[j]].first, a[k].first));           long long miny = min(a[e[i]].second, min(a[e[j]].second, a[k].second));           long long maxy = max(a[e[i]].second, max(a[e[j]].second, a[k].second));           if (p < ((maxx - minx) + (maxy - miny)) * 2) {             p = ((maxx - minx) + (maxy - miny)) * 2;           }         }       }     }     cout << p <<    ;     for (int i = 0; i < n - 3; i++)       cout << ((mxx - mnx) + (mxy - mny)) * 2 <<    ;   }   