#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}


int main(void){
  ll a,b;
  ll n;cin>>n>>a>>b; a--;b--;
  vector<ll> X,Y;
  rep(i,n){
    ll x,y;cin>>x>>y;
    X.push_back(x+y);
    Y.push_back(x-y);
  }
  ll r = max(abs(X[a]-X[b]),abs(Y[a]-Y[b]));
  set<pair<ll,ll>> Sx,Sy;
  rep(i,n){
    if(i == a || i == b) continue;
    Sx.insert({X[i],Y[i]});
    Sy.insert({Y[i],X[i]});
  }
  queue<pair<ll,ll>> q;
  q.push({X[a],Y[a]});
  q.push({X[b],Y[b]});
  vector<pair<ll,ll>> ok;
  cerr<<"r"<<r<<endl;

  while(q.size() > 0){
    ll x = q.front().first;
    ll y = q.front().second;
    ok.push_back({x,y});
    q.pop();
    auto itr = Sx.lower_bound({x - r, y - r});
    while(itr != Sx.end() &&
      itr -> first == x-r && itr -> second <= y+r){
      q.push(*itr);
      Sy.erase({itr->second, itr->first});
      itr = Sx.erase(itr);
    }
    itr = Sx.lower_bound({x + r, y - r});
    while(itr != Sx.end() &&
      itr -> first == x+r && itr -> second <= y+r){
      q.push(*itr);
      Sy.erase({itr->second, itr->first});
      itr = Sx.erase(itr);
    }

    itr = Sy.lower_bound({y - r, x - r});
    while(itr != Sy.end() &&
      itr -> first == y-r && itr -> second <= x+r){
      q.push({itr->second,itr->first});
      Sx.erase({itr->second,itr->first});
      itr = Sy.erase(itr);
    }
    itr = Sy.lower_bound({y + r, x - r});
    while(itr != Sy.end() &&
      itr -> first == y+r && itr -> second <= x+r){
      q.push({itr->second,itr->first});
      Sx.erase({itr->second,itr->first});
      itr = Sy.erase(itr);
    }
  }

  ll ans = 0;
  //Sx.clear();
  //Sy.clear();
  vector<ll> Vx,Vy;
  rep(i,n){
    Vx.push_back(X[i]*(ll)4e9 + Y[i]);
    Vy.push_back(Y[i]*(ll)4e9 + X[i]);
  }
  sort(all(Vx));
  sort(all(Vy));
  rep(i,ok.size()){
    ll x = ok[i].first, y = ok[i].second;
    //cerr<<(x+y)/2<<" "<<(x-y)/2<<endl;;
    ans += upper_bound(all(Vx), (x-r)*(ll)4e9 + y+r) - lower_bound(all(Vx), (x-r)*(ll)4e9 + y-r);
    ans += upper_bound(all(Vx), (x+r)*(ll)4e9 + y+r) - lower_bound(all(Vx), (x+r)*(ll)4e9 + y-r);
    ans += upper_bound(all(Vy), (y-r)*(ll)4e9 + x+r-1) - lower_bound(all(Vy), (y-r)*(ll)4e9 + x-r+1);
    ans += upper_bound(all(Vy), (y+r)*(ll)4e9 + x+r-1) - lower_bound(all(Vy), (y+r)*(ll)4e9 + x-r+1);
  }
  cout<<ans/2<<endl;
  return 0;
}


Measured memory_bytes: 17516