#include <bits/stdc++.h>
using namespace std;
const int NMax = 110000;
const long long INF = 1000000000LL;
int N;
pair<long long, int> A[NMax], B[NMax];
multiset<pair<long long, int> > S;
long long Max[NMax], Min[NMax], Max1[NMax], Min1[NMax];
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    long long first, second;
    scanf("%lld%lld", &first, &second);
    A[i] = make_pair(first + second, i);
    B[i] = make_pair(first - second, i);
  }
  sort(A + 1, A + N + 1);
  Min[0] = 10000000000LL;
  Max[0] = -10000000000LL;
  for (int i = 1; i <= N; i++) {
    Max[i] = max(Max[i - 1], B[A[i].second].first);
    Min[i] = min(Min[i - 1], B[A[i].second].first);
  }
  Min1[N + 1] = 10000000000LL;
  Max1[N + 1] = -10000000000LL;
  for (int i = N; i >= 1; i--) {
    Max1[i] = max(Max1[i + 1], B[A[i].second].first);
    Min1[i] = min(Min1[i + 1], B[A[i].second].first);
  }
  long long l = -1, r = 4 * INF + 10;
  while (l < r) {
    if (l + 1 == r) break;
    long long mid = (l + r) >> 1;
    bool flag = 0;
    int second = 2;
    for (int i = 1; i <= N; i++) {
      while (second <= N && A[second].first <= A[i].first + mid) second++;
      long long maxx = -10000000000LL, minn = 10000000000LL;
      if (i != 1) maxx = Max[i - 1], minn = Min[i - 1];
      if (second <= N)
        maxx = max(maxx, Max1[second]), minn = min(minn, Min1[second]);
      if (maxx == -10000000000LL) {
        flag = 1;
        break;
      }
      if (maxx - minn <= mid) {
        flag = 1;
        break;
      }
    }
    if (flag)
      r = mid;
    else
      l = mid;
  }
  double ret = (double)r / 2;
  printf("%lf\n", ret);
  return 0;
}
