#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

void TopologicalSort_dfs(vector<vector<int> > &G, vector<int> &res, int node, vector<bool> &visit){
  if(visit[node] == true) return;
  visit[node] = true;
  for(auto itr = G[node].rbegin(); itr != G[node].rend(); itr++){
    TopologicalSort_dfs(G, res, *itr, visit);
  }
  /*
  for(int i=0; i<G[node].size(); i++){
    TopologicalSort(G, res, G[node][i], visit);
  }
  */
  res.push_back(node);
}

vector<int> TopologicalSort(vector<vector<int>> &G){
  int n = G.size();
  vector<int> ret;
  vector<bool> visit(n,false);
  for(int i=0; i<n; i++){
    if(visit[i]) continue;
    TopologicalSort_dfs(G, ret, i, visit);    
  }
  reverse(ret.begin(), ret.end());
  return ret;
}

class SCC{
  int n;
  vector<vector<int> > G;
  vector<vector<int> > rG;
  
  void dfs(vector<bool> &visit, int pos, vector<int> &result){
    visit[pos] = true;
    for(int i=0; i<G[pos].size(); i++){
      if(visit[ G[pos][i] ]) continue;
      dfs(visit, G[pos][i], result);
    }
    result.push_back(pos);
  }

  void rdfs(vector<bool> &visit, int pos, int k){
    visit[pos] = true;
    component[pos] = k;
    for(int i=0; i<rG[pos].size(); i++){
      if(visit[ rG[pos][i] ]) continue;
      rdfs(visit, rG[pos][i], k);
    }
  }

  void make_rev(vector<vector<int> > &G){
    for(int i=0; i<n; i++){
      for(int j=0; j<G[i].size(); j++){
        rG[ G[i][j] ].push_back(i);
      }
    }
  }

 public:
  int num_components;
  vector<int> component;
  vector< vector<int> > scc_graph;
  
  SCC(int n){
    this->n = n;
    G.resize(n);
    rG.resize(n);
  }

  SCC(vector<vector<int> > &G){
    this->n = G.size();
    this->G = G;
    rG.resize(n);
    make_rev(G);
  }
  
  void strongly_connected_components(){
    vector<bool> visit(n, false);
    vector<int> result;

    for(int i=0; i<n; i++){
      if(visit[i]) continue;
      dfs(visit, i, result);
    }

    
    component.resize(n);
    fill(visit.begin(), visit.end(), false);
    int k=0;
    for(int i=result.size()-1; i>=0; i--){
      if(visit[ result[i] ]) continue;
      rdfs(visit, result[i], k);
      k++;
    }

    num_components = k;
    scc_graph.resize( num_components );
    for(int i=0; i<n; i++){
      int cmp = component[i];
      for(int j=0; j<G[i].size(); j++){
        if(component[ G[i][j] ] == cmp) continue;
        scc_graph[cmp].push_back( component[ G[i][j] ] );
      }
    }
    
    for(int i=0; i<scc_graph.size(); i++){
      sort(scc_graph[i].begin(), scc_graph[i].end());
      scc_graph[i].erase( unique(scc_graph[i].begin(), scc_graph[i].end()), scc_graph[i].end());
    }
    
  }
  
  void add_edge(int from, int to){
    G[from].push_back(to);
    rG[to].push_back(from);
  }
};


// require scc
// require topological sorting
// O(N)
class TwoSAT{
  int n;
  vector<pair<int,int>> f;
  vector<vector<int>> G;
 public:
  vector<bool> ans;
  bool has_solution;
  TwoSAT(int num_of_variables) : n(num_of_variables), G(num_of_variables*2), ans(num_of_variables), has_solution(false){
  }

  // 1<=x,y<=num_of_variables
  // (x OR !y) => add(x, -y)
  // (x||y) <=> ( !y=>x && !x=>y )
  void add(int x, int y){
    assert( 1 <= abs(x) && abs(x) <= n);
    assert( 1 <= abs(y) && abs(y) <= n);
    x = (x>0)?x-1:n-x-1;
    y = (y>0)?y-1:n-y-1;
    int not_x = (x+n)%(n+n);
    int not_y = (y+n)%(n+n);
    G[not_x].push_back(y);
    G[not_y].push_back(x);
  }

  // has solution ? true : false
  bool solve(){
    SCC scc(G);
    scc.strongly_connected_components();

    auto d = TopologicalSort(scc.scc_graph);
    auto c = scc.component;
    for(int i=0; i<n; i++){
      if( c[i] == c[i+n] ){ // x and !x in the same scc
        has_solution = false;
        return false;
      }
    }

    has_solution = true;
    vector<int> c_t( d.size() ); // topological order of component x
    for(int i=0; i<d.size(); i++){
      c_t[ d[i] ]  = i;
    }

    for(int i=0; i<n; i++){
      if( c_t[ c[i] ] < c_t[ c[i+n] ] ){
        ans[i] = false;
      }else{
        ans[i] = true;
      }
    }

    return true;
  }
};

int main(){
  int n;
  cin >> n;

  vector< pair<int,int> > pos(n);
  cin >> pos;

  vector<int> x;
  for(int i : range(n)){
    x.push_back( pos[i].first );
    x.push_back( pos[i].second );
  }

  sort( x.begin(), x.end() );
  x.erase( unique(x.begin(), x.end()), x.end());

  vector<pair<int,int>> y;
  vector<pair<int,int>> z;
  for(int i=0; i<n; i++){
    y.emplace_back(
      lower_bound(x.begin(), x.end(), pos[i].first) - x.begin(),
      lower_bound(x.begin(), x.end(), pos[i].second) - x.begin()
    );
    z.emplace_back( pos[i].first, i+1 );
    z.emplace_back( pos[i].second, -(i+1) );
  }

  sort(z.begin(), z.end());

  vector<pair<int,int>> yy(n);
  for(int i=0; i<n; i++){
    int a = lower_bound(z.begin(), z.end(), pair<int,int>{pos[i].first, i+1}) - z.begin();
    int b = lower_bound(z.begin(), z.end(), pair<int,int>{pos[i].second, -(i+1)}) - z.begin();
    yy[i] = {a,b};
  }

  long long ans = 0;

  int k = 1;
  while(k < z.size()){
    k*=2;
  }

  auto check = [&](long long D){
    TwoSAT sat(k*2);
    for(int i=0; i<k-1; i++){
      sat.add( i+1, -(i*2+1+1));
      sat.add( i+1, -(i*2+2+1));
    }
    for(int i=0; i<n; i++){
      sat.add( -(yy[i].first + k), -(yy[i].second + k) );
      sat.add(  (yy[i].first + k),  (yy[i].second + k) );
    }

    // [lb,ub), [l,r)
    function<void(int,int,int,int,int,int)> rec = [&](int lb, int ub, int l, int r, int pos, int w){
      if( r<=lb || ub<=l ) return;
      if( lb<=l && r<=ub ){
        sat.add( -w, -(pos+1) );
        return;
      }
      rec(lb,ub, l, (l+r)/2, pos*2+1, w);
      rec(lb,ub, (l+r)/2, r, pos*2+2, w);
    };

    for(int i=0; i<z.size(); i++){
      int d_left = z[i].first - D;
      auto l_itr = upper_bound(z.begin(), z.end(), pair<int,int>{ d_left, +2*n} );
      int ll = l_itr - z.begin();

      int d_right = z[i].first + D;
      auto r_itr = lower_bound(z.begin(), z.end(), pair<int,int>{ d_right, -100000} );
      int rr = r_itr - z.begin();

      if( ll < i ){ // [ll,i)
        rec(ll, i, 0, k, 0, i+k );
      }
      if( rr > i){ // [i+1,rr)
        rec(i+1, rr, 0, k, 0, i+k );
      }
    }
    bool ok = sat.solve();
    return ok;
  };

  long long lb = 0;
  long long ub = 1000000000;
  while(ub-lb>1){
    long long mid = (lb+ub)/2;
    bool ok = check(mid);
    (ok? lb : ub) = mid;
  }
  println(lb);

  return 0;
}


Measured memory_bytes: 47508