#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
template<typename T1, typename T2> bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) { return a.first != b.first ? a.first < b.first : a.second > b.second; }


/* -------- <templates end> -------- */


struct Point {
  ll x, y; int idx;

  Point(ll x, ll y, int idx = -1) : x(x), y(y), idx(idx) {}

  ll operator-(const Point &p) const {
    return max(abs(x - p.x), abs(y - p.y));
  }

  bool operator<(const Point &p) const {
    return x != p.x ? x < p.x : y < p.y;
  }

  Point swap() const {
    return Point(y, x, idx);
  }
};

void solve() {
  int n, a, b; cin >> n >> a >> b; --a, --b;

  vector<Point> points, Xpoints, Ypoints;
  rep(i,n) {
    ll x, y; cin >> x >> y;
    points.emplace_back(x+y, x-y, i);
    Xpoints.emplace_back(x+y, x-y, i);
    Ypoints.emplace_back(x-y, x+y, i);
  }

  sort(ALL(Xpoints));
  sort(ALL(Ypoints));

  ll dist = points[a] - points[b];

  set<Point> Xset, Yset;
  for (auto &p : Xpoints) Xset.emplace_hint(Xset.end(), p);
  for (auto &p : Ypoints) Yset.emplace_hint(Yset.end(), p);

  queue<int> que;
  que.push(a);
  Xset.erase(points[a]);
  Yset.erase(points[a].swap());

  ll ans = 0;

  while (!que.empty()) {
    int v = que.front(); que.pop();

    Point &p = points[v];
    Point pp = {p.x + dist, p.y + dist};
    Point pm = {p.x + dist, p.y - dist};
    Point mp = {p.x - dist, p.y + dist};
    Point mm = {p.x - dist, p.y - dist};

    ans += upper_bound(ALL(Xpoints), mp) - lower_bound(ALL(Xpoints), mm);
    ans += upper_bound(ALL(Xpoints), pp) - lower_bound(ALL(Xpoints), pm);
    ans += lower_bound(ALL(Ypoints), pm.swap()) - upper_bound(ALL(Ypoints), mm.swap());
    ans += lower_bound(ALL(Ypoints), pp.swap()) - upper_bound(ALL(Ypoints), mp.swap());

    while (1) {
      auto itr = Xset.lower_bound(mm);
      if (itr == Xset.end() || itr->x != mp.x || itr->y > mp.y) break;
      que.push(itr->idx);
      Yset.erase(itr->swap());
      Xset.erase(itr);
    }

    while (1) {
      auto itr = Xset.lower_bound(pm);
      if (itr == Xset.end() || itr->x != pp.x || itr->y > pp.y) break;
      que.push(itr->idx);
      Yset.erase(itr->swap());
      Xset.erase(itr);
    }

    while (1) {
      auto itr = Yset.lower_bound(mm.swap());
      if (itr == Yset.end() || itr->x != pm.y || itr->y > pm.x) break;
      que.push(itr->idx);
      Xset.erase(itr->swap());
      Yset.erase(itr);
    }

    while (1) {
      auto itr = Yset.lower_bound(mp.swap());
      if (itr == Yset.end() || itr->x != pp.y || itr->y > pp.x) break;
      que.push(itr->idx);
      Xset.erase(itr->swap());
      Yset.erase(itr);
    }
  }

  cout << ans / 2 << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 21008