#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;

template<class T>
vector<T> compress(vector<T> a, vector<T>& b){
  b = a;
  sort(b.begin(), b.end());
  b.erase( unique(b.begin(), b.end()), b.end());
  for(size_t i=0; i<a.size(); i++){
    a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
  }
  return a;
}


class UnionFindTree{
  struct base_node{
    int parent;
    int rank;
    int size;
  };
  
  vector<base_node> node;
 public:
  UnionFindTree(int n){
    node.resize(n);
    for(int i=0; i<n; i++){
      node[i].parent=i;
      node[i].rank=0;
      node[i].size=1;
    }
  }

  int find(int x){  //return root node of x
    if(node[x].parent == x) return x;
    else{
      return node[x].parent = find(node[x].parent);
    }
  }
  
  bool same(int x, int y){
    return find(x) == find(y);
  }

  int size(int at){
    return node[find(at)].size;
  }

  void unite(int x, int y){
    x = find(node[x].parent);
    y = find(node[y].parent);

    if(x==y) return;

    if(node[x].rank < node[y].rank){
      node[x].parent = y;
      node[y].size += node[x].size;
    }else if(node[x].rank > node[y].rank){
      node[y].parent = x;
      node[x].size += node[y].size;
    }else{
      node[x].rank++;
      unite(x,y);
    }
  }
};

int main(){
  int n,a,b;
  cin >> n,a,b;
  a--; b--;
  vector<long long> x(n), y(n);
  for(auto i : range(n) ){
    long long xx,yy;
    cin >> xx, yy;
    x[i] = xx - yy;
    y[i] = xx + yy;
  }

  long long d = max(abs(x[a] - x[b]) , abs(y[a] - y[b]));

  vector<long long> dx,dy;
  auto xx = compress(x, dx);
  auto yy = compress(y, dy);

  vector<vector<long long>> px(dx.size());
  vector<vector<long long>> py(dy.size());
  vector<vector<int>> ix(dx.size());
  vector<vector<int>> iy(dy.size());
  for(auto i : range(n) ){
    px[ xx[i] ].push_back( y[i] );
    py[ yy[i] ].push_back( x[i] );
    ix[ xx[i] ].push_back( i );
    iy[ yy[i] ].push_back( i );
  }

  for(auto& v : px) sort(v.begin(), v.end());
  for(auto& v : ix) sort(v.begin(), v.end(), [&](int p, int q){ return y[p] < y[q]; });
  for(auto& v : py) sort(v.begin(), v.end());
  for(auto& v : iy) sort(v.begin(), v.end(), [&](int p, int q){ return x[p] < x[q]; });

  long long ans = 0;
  vector<int> cnt(n, 0);
  auto f = [&](int pos){
    if(binary_search( dx.begin(), dx.end(), x[pos]-d )){
      int z = lower_bound(dx.begin(), dx.end(), x[pos]-d) - dx.begin();
      cnt[pos] += upper_bound(px[z].begin(), px[z].end(), y[pos]+d) - lower_bound(px[z].begin(), px[z].end(), y[pos]-d);
    }
    if(binary_search( dx.begin(), dx.end(), x[pos]+d )){
      int z = lower_bound(dx.begin(), dx.end(), x[pos]+d) - dx.begin();
      cnt[pos] += upper_bound(px[z].begin(), px[z].end(), y[pos]+d) - lower_bound(px[z].begin(), px[z].end(), y[pos]-d);
    }
    if(binary_search( dy.begin(), dy.end(), y[pos]-d )){
      int z = lower_bound(dy.begin(), dy.end(), y[pos]-d) - dy.begin();
      cnt[pos] += lower_bound(py[z].begin(), py[z].end(), x[pos]+d) - upper_bound(py[z].begin(), py[z].end(), x[pos]-d);
    }
    if(binary_search( dy.begin(), dy.end(), y[pos]+d )){
      int z = lower_bound(dy.begin(), dy.end(), y[pos]+d) - dy.begin();
      cnt[pos] += lower_bound(py[z].begin(), py[z].end(), x[pos]+d) - upper_bound(py[z].begin(), py[z].end(), x[pos]-d);
    }
  };

  for(auto i : range(n) ){
    f(i);
  }

  UnionFindTree uft(n);

  for(auto i : range(dx.size()) ){
    if(binary_search(dx.begin(), dx.end(), dx[i]+d) == false) continue;
    int j = lower_bound(dx.begin(), dx.end(), dx[i]+d) - dx.begin();

    int l=0;
    for(int k : ix[i]){
      while( l<ix[j].size() && y[ ix[j][l] ] < y[ k ]-d ) l++;
      if( l<ix[j].size() && y[ ix[j][l] ] <= y[ k ]+d ) uft.unite( k, ix[j][l] );
      while( l+1<ix[j].size() && y[ ix[j][l+1] ] <= y[ k ]+d ){
        l++;
        uft.unite( k, ix[j][l] );
      }
    }
  }
  for(auto i : range(dy.size()) ){
    if(binary_search(dy.begin(), dy.end(), dy[i]+d) == false) continue;
    int j = lower_bound(dy.begin(), dy.end(), dy[i]+d) - dy.begin();

    int l=0;
    for(int k : iy[i]){
      while( l<iy[j].size() && x[ iy[j][l] ] < x[ k ]-d ) l++;
      if( l<iy[j].size() && x[ iy[j][l] ] <= x[ k ]+d ) uft.unite( k, iy[j][l] );
      while( l+1<iy[j].size() && x[ iy[j][l+1] ] <= x[ k ]+d ){
        l++;
        uft.unite( k, iy[j][l] );
      }
    }
  }

  uft.unite(a,b);
  for(auto i : range(n) ){
    if( uft.same(i,a) ){
      ans += cnt[i];
    }
  }

  println(ans/2);

  return 0;
}


Measured memory_bytes: 25472