#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

void f(vector<Pll>& vp, vector<Pll>& ret, int a, int b) {
	unordered_map<ll, map<ll, int>> mx, my;
	FOR(i,sz(vp)) {
		auto& xy = vp[i];
		mx[xy.first][xy.second] = i;
		my[xy.second][xy.first] = i;
	}

	auto del_i = [&](int id) {
		const Pll pt = vp[id];
		mx[pt.first].erase(pt.second);
		my[pt.second].erase(pt.first);
	};

	const ll D = max(abs(vp[a].first - vp[b].first), abs(vp[a].second - vp[b].second));
	static bool used[ten(5)];
	memset(used, 0, sizeof(used));
	used[a] = true;
	used[b] = true;

	del_i(a);
	del_i(b);

	queue<int> q;
	q.push(a);
	q.push(b);

	vector<int> tmp;
	auto add_used = [&](unordered_map<ll, map<ll, int>>& um, ll x, ll ly, ll ry) {
		tmp.clear();

		auto it = um.find(x);
		if (it == um.end()) return;
		auto& mp = it->second;
		auto i2 = mp.lower_bound(ly);
		for (; i2 != mp.end();) {
			ll cury = i2->first;
			if (cury > ry) break;
			tmp.push_back(i2->second);
			++i2;
		}

		for (auto id : tmp) {
			q.push(id);
			del_i(id);
			used[id] = true;
		}
	};

	while (!q.empty()) {
		const int id = q.front(); q.pop();
		Pll& cur = vp[id];
		add_used(mx, cur.first - D, cur.second - D, cur.second + D);
		add_used(mx, cur.first + D, cur.second - D, cur.second + D);
		add_used(my, cur.second - D, cur.first - D, cur.first + D);
		add_used(my, cur.second + D, cur.first - D, cur.first + D);
	}

	FOR(i, sz(vp)) {
		if (used[i]) ret.push_back(vp[i]);
	}
}

ll g(vector<Pll>& vp, ll D) {
	unordered_map<ll, vector<ll>> mx, my;
	FOR(i, sz(vp)) {
		auto& xy = vp[i];
		mx[xy.first].push_back(xy.second);
		my[xy.second].push_back(xy.first);
	}
	for (auto& kv : mx) {
		sort(kv.second.begin(), kv.second.end());
	}
	for (auto& kv : my) {
		sort(kv.second.begin(), kv.second.end());
	}

	auto fnd = [&](unordered_map<ll, vector<ll>>& um, ll x, ll ly, ll ry) {
		auto it = um.find(x);
		if (it == um.end()) return 0LL;
		auto& v = it->second;
		auto i2 = lower_bound(v.begin(), v.end(), ly);
		auto i3 = lower_bound(v.begin(), v.end(), ry + 1);

		ll len = i3 - i2;
		return len;
	};

	ll ret = 0;
	FOR(i, sz(vp)) {
		Pll& cur = vp[i];
		ll a = fnd(mx, cur.first - D, cur.second - D, cur.second + D);
		ll b = fnd(mx, cur.first + D, cur.second - D, cur.second + D);
		ll c = fnd(my, cur.second - D, cur.first - D + 1, cur.first + D - 1);
		ll d = fnd(my, cur.second + D, cur.first - D + 1, cur.first + D - 1);
		ret += a + b + c + d;
	}

	return ret / 2;
}

int main() {
	int n, a, b; reader(n, a, b);
	a--; b--;

	vector<Pll> vp;
	FOR(i, n) {
		ll x, y; reader(x, y);
		ll nx = x + y, ny = x - y;
		vp.emplace_back(nx, ny);
	}
	const ll D = max(abs(vp[a].first - vp[b].first), abs(vp[a].second - vp[b].second));

	vector<Pll> sv;
	f(vp, sv, a, b);
	ll ans = g(sv, D);
	writerLn(ans);

	return 0;
}

Measured memory_bytes: 33008