#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(nullptr));
const long long INF = 2e9, P = 1e9 + 7, N = 1e5 + 10;
const long double EPS = 1e-9;
int n;
pair<int, int> a[N], pref[N], suff[N];
bool check(long long d) {
  int j = -1;
  for (int i = 0; i < n; i++) {
    while (j + 1 < n && (long long)abs(a[i].first - a[j + 1].first) <= d) {
      j++;
    }
    int mn = min((i == 0 ? INF : pref[i - 1].first),
                 (j == n - 1 ? INF : suff[j + 1].first)),
        mx = max((i == 0 ? -INF : pref[i - 1].second),
                 (j == n - 1 ? -INF : suff[j + 1].second));
    if (mn == INF || (long long)mx - mn <= d) {
      return true;
    }
  }
  return false;
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
    int x = a[i].first, y = a[i].second;
    a[i].first = x - y;
    a[i].second = x + y;
  }
  sort(a, a + n);
  int mn = INF, mx = -INF;
  for (int i = 0; i < n; i++) {
    mn = min(mn, a[i].second);
    mx = max(mx, a[i].second);
    pref[i] = {mn, mx};
  }
  mn = INF;
  mx = -INF;
  for (int i = n - 1; i > -1; i--) {
    mn = min(mn, a[i].second);
    mx = max(mx, a[i].second);
    suff[i] = {mn, mx};
  }
  long long l = -1, r = 4e9 + 10;
  while (r - l > 1) {
    int mid = (l + r) / 2;
    if (check(mid)) {
      r = mid;
    } else {
      l = mid;
    }
  }
  cout << (long double)r / 2 << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(15) << fixed;
  solve();
  return 0;
}
