#include #include using namespace std; using ll = long long; #define rep(i, n) for (int i = 0; i < (int)(n); i++) int op1(int a, int b) { return max(a, b); } int op2(int a, int b) { return min(a, b); } const int inf = 1e9; int e1() { return -inf; } int e2() { return inf; } using maxsegtree = atcoder::segtree; using minsegtree = atcoder::segtree; int main() { int N; cin >> N; vector X(N), Y(N); rep(i, N) { cin >> X.at(i) >> Y.at(i); X.at(i)--; Y.at(i)--; } vector p(N); rep(i, N) p.at(i) = i; sort(p.begin(), p.end(), [&](int a, int b) { if (X.at(a) == X.at(b)) return Y.at(a) < Y.at(b); return X.at(a) < X.at(b); }); vector dist_min(N, inf), dist_max(N, -inf); maxsegtree mxa(N), mxb(N); minsegtree mna(N), mnb(N); for (int i : p) { dist_min.at(i) = min(dist_min.at(i), (X.at(i) + Y.at(i)) - mxa.prod(0, Y.at(i))); dist_min.at(i) = min(dist_min.at(i), (X.at(i) - Y.at(i)) - mxb.prod(Y.at(i), N)); dist_max.at(i) = max(dist_max.at(i), (X.at(i) + Y.at(i)) - mna.prod(0, Y.at(i))); dist_max.at(i) = max(dist_max.at(i), (X.at(i) - Y.at(i)) - mnb.prod(Y.at(i), N)); mxa.set(Y.at(i), X.at(i) + Y.at(i)); if(mna.get(Y.at(i)) > X.at(i) + Y.at(i)) mna.set(Y.at(i), X.at(i) + Y.at(i)); mxb.set(Y.at(i), X.at(i) - Y.at(i)); if(mnb.get(Y.at(i)) > X.at(i) - Y.at(i)) mnb.set(Y.at(i), X.at(i) - Y.at(i)); } reverse(p.begin(), p.end()); mxa = maxsegtree(N), mxb = maxsegtree(N); mna = minsegtree(N), mnb = minsegtree(N); for (int i : p) { dist_min.at(i) = min(dist_min.at(i), mna.prod(Y.at(i), N) - (X.at(i) + Y.at(i))); dist_min.at(i) = min(dist_min.at(i), mnb.prod(0, Y.at(i)) - (X.at(i) - Y.at(i))); dist_max.at(i) = max(dist_max.at(i), mxa.prod(Y.at(i), N) - (X.at(i) + Y.at(i))); dist_max.at(i) = max(dist_max.at(i), mxb.prod(0, Y.at(i)) - (X.at(i) - Y.at(i))); if(mxa.get(Y.at(i)) < X.at(i) + Y.at(i)) mxa.set(Y.at(i), X.at(i) + Y.at(i)); mna.set(Y.at(i), X.at(i) + Y.at(i)); if(mxb.get(Y.at(i)) < X.at(i) - Y.at(i)) mxb.set(Y.at(i), X.at(i) - Y.at(i)); mnb.set(Y.at(i), X.at(i) - Y.at(i)); } int ans = inf; rep(i, N) ans = min(ans, dist_max.at(i) - dist_min.at(i)); cout << ans << endl; }