//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,a,b;cin>>n>>a>>b;a--;b--;
  vector<ll>x(n),y(n);
  rep(i,0,n)cin>>x[i]>>y[i];
  ll d=abs(x[a]-x[b])+abs(y[a]-y[b]);
  rep(i,0,n){
    ll kx=x[i],ky=y[i];
    x[i]=kx+ky;
    y[i]=kx-ky;
  }
  vector<bool>t(n);
  {
    map<ll,set<P>>sx,sy;
    rep(i,0,n){
      sx[x[i]].emplace(y[i],i);
      sy[y[i]].emplace(x[i],i);
    }
    //debug(x,n);
    //debug(y,n);
    queue<ll>que;
    que.push(a);
    que.push(b);
    while(!que.empty()){
      auto p=que.front();
      que.pop();
      if(t[p])continue;
      t[p]=true;
      rep(i,0,2){
        ll v=x[p]+d;if(i)v=x[p]-d;
        //cout<<p spa v spa sx.count(v)<<endl;
        if(!sx.count(v))continue;
        auto itr=sx[v].lower_bound(MP(y[p]-d,-1));
        while(itr!=sx[v].end()){
          if(itr->fi>y[p]+d)break;
          que.push(itr->se);
          itr=sx[v].erase(itr);
        }
      }
      rep(i,0,2){
        ll v=y[p]+d;if(i)v=y[p]-d;
        if(!sy.count(v))continue;
        auto itr=sy[v].lower_bound(MP(x[p]-d,-1));
        while(itr!=sy[v].end()){
          if(itr->fi>x[p]+d)break;
          que.push(itr->se);
          itr=sy[v].erase(itr);
        }
      }
    }
    //debug(t,n);
  }
  map<ll,vector<ll>>mx,my;
  rep(i,0,n){
    if(!t[i])continue;
    mx[x[i]].PB(y[i]);
    my[y[i]].PB(x[i]);
  }
  for(auto &z:mx)sort(ALL(z.se));
  for(auto &z:my)sort(ALL(z.se));
  rep(i,0,n){
    if(!t[i])continue;
    //cout<<i spa res spa upper_bound(ALL(mx[x[i]+d]),y[i]+d)-lower_bound(ALL(mx[x[i]+d]),y[i]-d) spa mx[x[i]+d].size()<<endl;
    if(mx.count(x[i]+d)){
      ll idx=upper_bound(ALL(mx[x[i]+d]),y[i]+d)-lower_bound(ALL(mx[x[i]+d]),y[i]-d);
      res+=idx;
    }
    if(my.count(y[i]+d)){
      ll idx=lower_bound(ALL(my[y[i]+d]),x[i]+d)-upper_bound(ALL(my[y[i]+d]),x[i]-d);
      res+=idx;
    }
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 33448