#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
  static unsigned long long splitmix64(unsigned long long x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(unsigned long long x) const {
    static const unsigned long long FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
mt19937 random_generator(
    chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e5 + 3;
int n;
pair<int, int> pts[maxn];
void read() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> pts[i].first >> pts[i].second;
}
pair<int, int> pr[maxn], su[maxn];
void precompute() {
  pr[1] = {pts[1].second, pts[1].second};
  for (int i = 2; i <= n; i++)
    pr[i] = {min(pts[i].second, pr[i - 1].first),
             max(pts[i].second, pr[i - 1].second)};
  su[n] = {pts[n].second, pts[n].second};
  for (int i = n - 1; i >= 1; i--)
    su[i] = {min(pts[i].second, su[i + 1].first),
             max(pts[i].second, su[i + 1].second)};
}
bool can(double x) {
  int pos = 1;
  for (int i = 1; i <= n; i++) {
    while (pos <= n && pts[pos].first - pts[i].first <= 2 * x) pos++;
    int mins = (int)1e9, maxs = (int)-1e9;
    if (i != 1)
      mins = min(mins, pr[i - 1].first), maxs = max(maxs, pr[i - 1].second);
    if (pos != n + 1)
      mins = min(mins, su[pos].first), maxs = max(maxs, su[pos].second);
    if (maxs - mins <= 2 * x) return true;
  }
  return false;
}
void solve() {
  for (int i = 1; i <= n; i++) {
    int x = pts[i].first, y = pts[i].second;
    pts[i].first = x + y;
    pts[i].second = x - y;
  }
  sort(pts + 1, pts + n + 1);
  precompute();
  double low = 0, high = 1e9;
  for (int i = 1; i <= 1000; i++) {
    double mid = (low + high) / 2.0;
    if (can(mid))
      high = mid;
    else
      low = mid;
  }
  cout << fixed;
  cout << setprecision(10) << low << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  read();
  solve();
}
