func_code_string: #include <bits/stdc++.h>   using namespace std;   pair<long long, long long> a[1000005];   bool fl1, fl2, fl3, fl4;   long long dist(pair<long long, long long> a, pair<long long, long long> b) {     return abs(a.first - b.first) + abs(a.second - b.second);   }   signed main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     long long i, j, k, l, m, n, t, r, cnt;     long long flag = 0;     long long an = 0, ans = 0;     t = 1;     while (t--) {       cin >> n;       long long x, y;       for (i = 0; i < n; i++) {         cin >> x >> y;         a[i] = make_pair(x, y);       }       long long xmi, xma, yma, ymi;       xmi = 1LL * 1e18;       ymi = 1LL * 1e18;       yma = -1LL * 1e18;       xma = -1LL * 1e18;       for (i = 0; i < n; i++) {         xmi = min(xmi, a[i].first);         xma = max(xma, a[i].first);         ymi = min(ymi, a[i].second);         yma = max(yma, a[i].second);       }       ans = 2LL * (xma - xmi + yma - ymi);       vector<pair<long long, long long> > b;       for (i = 0; i < n; i++) {         if (a[i].first == xmi && !fl1) {           fl1 = true;           b.push_back(a[i]);         }         if (a[i].first == xma && !fl2) {           fl2 = true;           b.push_back(a[i]);         }         if (a[i].second == ymi && !fl3) {           fl3 = true;           b.push_back(a[i]);         }         if (a[i].second == yma && !fl4) {           fl4 = true;           b.push_back(a[i]);         }       }       b.push_back(make_pair(xmi, ymi));       b.push_back(make_pair(xmi, yma));       b.push_back(make_pair(xma, yma));       b.push_back(make_pair(xma, ymi));       an = -1LL * 1e18;       for (i = 0; i < n; i++) {         for (j = 0; j < 4; j++) {           for (k = 0; k < 4; k++) {             if (b[j] == a[i] || b[k] == a[i]) continue;             an = max(an, dist(a[i], b[j]) + dist(b[k], a[i]) + dist(b[j], b[k]));           }         }       }       cout << an <<    ;       for (i = 4; i <= n; i++) {         cout << ans <<    ;       }       cout << endl;     }   }   