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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll cnt[100010];
bool ok[100010];

int main(int argc, char const* argv[])
{
  int n, a, b; cin >> n >> a >> b, a--, b--;
  vector<ll> x(n), y(n); rep(i, n)cin >> x[i] >> y[i];
  ll r = abs(x[a] - x[b]) + abs(y[a] - y[b]);
  rep(i, n){
    ll xt = x[i], yt = y[i];
    x[i] = xt + yt;
    y[i] = xt - yt;
  }
  map<ll, vector<int>> mpx, mpy;
  map<pair<ll, ll>, int> mp;
  map<ll, set<int>> spx, spy;
  rep(i, n){
    mpx[x[i]].pb(y[i]);
    mpy[y[i]].pb(x[i]);
    mp[mk(x[i], y[i])] = i;
    spx[x[i]].insert(y[i]);
    spy[y[i]].insert(x[i]);
  }
  irep(itr, mpx){
    sort(all(itr->second));
  }
  irep(itr, mpy){
    sort(all(itr->second));
  }
  rep(i, n){
    auto &v = mpx[x[i] + r];
    if(sz(v) > 0){
      int li = lower_bound(all(v), y[i] - r) - v.begin();
      int ri = upper_bound(all(v), y[i] + r) - v.begin();
      cnt[i] += ri - li;
    }
    auto& v1 = mpx[x[i] - r];
    if(sz(v1) > 0){
      int li = lower_bound(all(v1), y[i] - r) - v1.begin();
      int ri = upper_bound(all(v1), y[i] + r) - v1.begin();
      cnt[i] += ri - li;
    }
    auto &v2 = mpy[y[i] + r];
    if(sz(v2) > 0){
      int li = lower_bound(all(v2), x[i] - r) - v2.begin();
      int ri = upper_bound(all(v2), x[i] + r) - v2.begin();
      cnt[i] += ri - li;
    }
    auto &v3 = mpy[y[i] + r];
    if(sz(v3) > 0){
      int li = lower_bound(all(v3), x[i] - r) - v3.begin();
      int ri = upper_bound(all(v3), x[i] + r) - v3.begin();
      cnt[i] += ri - li;
    }
    if(mp.find(mk(x[i] + r, y[i] + r)) != mp.end())cnt[i]--;
    if(mp.find(mk(x[i] - r, y[i] + r)) != mp.end())cnt[i]--;
    if(mp.find(mk(x[i] + r, y[i] - r)) != mp.end())cnt[i]--;
    if(mp.find(mk(x[i] - r, y[i] - r)) != mp.end())cnt[i]--;
  }
  queue<int> q;
  q.push(a); q.push(b);
  spx[x[a]].erase(y[a]);
  spy[y[a]].erase(x[a]);
  spx[x[b]].erase(y[b]);
  spy[y[b]].erase(x[b]);
  while(!q.empty()){
    int i = q.front(); q.pop();
    if(ok[i])continue;
    ok[i] = true;
    auto& st1 = spx[x[i] + r];
    auto itr = st1.lower_bound(y[i] - r);
    while(itr != st1.end() && *itr <= y[i] + r){
      ll Y = *itr;
      int idx = mp[mk(x[i] + r, Y)];
      q.push(idx);
      spy[y[idx]].erase(x[idx]);
      itr = st1.erase(itr);
    }
    auto& st2 = spx[x[i] - r];
    itr = st2.lower_bound(y[i] - r);
    while(itr != st2.end() && *itr <= y[i] + r){
      ll Y = *itr;
      int idx = mp[mk(x[i] - r, Y)];
      q.push(idx);
      spy[y[idx]].erase(x[idx]);
      itr = st2.erase(itr);
    }
    auto& st3 = spy[y[i] + r];
    itr = st3.lower_bound(x[i] - r);
    while(itr != st3.end() && *itr <= x[i] + r){
      ll X = *itr;
      int idx = mp[mk(X, y[i] + r)];
      q.push(idx);
      spx[x[idx]].erase(y[idx]);
      itr = st3.erase(itr);
    }
    auto& st4 = spy[y[i] - r];
    itr = st4.lower_bound(x[i] - r);
    while(itr != st4.end() && *itr <= x[i] + r){
      ll X = *itr;
      int idx = mp[mk(X, y[i] - r)];
      q.push(idx);
      spx[x[idx]].erase(y[idx]);
      itr = st4.erase(itr);
    }
  }

  ll res = 0;
  rep(i, n)if(ok[i])res += cnt[i];
  cout << res / 2 << endl;
  return 0;
}


Measured memory_bytes: 82688