#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

inline ll dist(pll &a, pll &b){
	return max(abs(a.F-b.F),abs(a.S-b.S));
}
vector<pll> v;
vll used;
ll d;
using P=pair<pll,int>;
set<P> se;

vvint vv;
map<ll,set<pll>> xv;
map<ll,set<pll>> yv;

void dfs(int a){
	if(used[a]) return;
	// cout << "dfs "<<a << endl;
	used[a]=1;
	ll x,y;
	tie(x,y) = v[a];
	while(1){
		auto& se = xv[x-d];
		auto it = se.lower_bound({y-d, -1});
		if(it == se.end()) break;
		if(it->F > y+d){
			break;
		}
		int xx = it->S;
		vv[a].PB(xx);
		vv[xx].PB(a);
		// cout<<a<<" "<<xx<<endl;
		se.erase(it);
		dfs(xx);
	}
	while(1){
		auto& se = xv[x+d];
		auto it = se.lower_bound({y-d, -1});
		if(it == se.end()) break;
		if(it->F > y+d){
			break;
		}
		int xx = it->S;
		vv[a].PB(xx);
		vv[xx].PB(a);
		// cout<<a<<" "<<xx<<endl;
		se.erase(it);
		dfs(xx);
	}
	while(1){
		auto& se = yv[y-d];
		auto it = se.lower_bound({x-d, -1});
		if(it == se.end()) break;
		if(it->F > x+d){
			break;
		}
		int xx = it->S;
		vv[a].PB(xx);
		vv[xx].PB(a);
		// cout<<a<<" "<<xx<<endl;
		se.erase(it);
		dfs(xx);
	}
	while(1){
		auto& se = yv[y+d];
		auto it = se.lower_bound({x-d, -1});
		if(it == se.end()) break;
		if(it->F > x+d){
			break;
		}
		int xx = it->S;
		vv[a].PB(xx);
		vv[xx].PB(a);
		// cout<<a<<" "<<xx<<endl;
		se.erase(it);
		dfs(xx);
	}
}

vector<pll> yse;
vector<pll> xse;

int dx[]={1,1,-1,-1};
int dy[]={1,-1,1,-1};

void dfs2(int u){
	if(used[u]) return;
	ll x, y;
	tie(x,y) = v[u];
	// if(fout) cout<<"xy "<<x<<" "<<y<<endl;
	used[u] += upper_bound(ALL(yse), pll(x-d,y+d)) -  lower_bound(ALL(yse), pll(x-d,y-d));
	// cout <<  upper_bound(ALL(yse), pll(x-d,y+d))->S <<" "<<  lower_bound(ALL(yse), pll(x-d,y-d))->S<<endl;

	used[u] += upper_bound(ALL(yse), pll(x+d,y+d)) -  lower_bound(ALL(yse), pll(x+d,y-d));
	// cout <<  upper_bound(ALL(yse), pll(x+d,y+d))->S <<" "<<  lower_bound(ALL(yse), pll(x+d,y-d))->S<<endl;

	used[u] += upper_bound(ALL(xse), pll(y-d,x+d)) -  lower_bound(ALL(xse), pll(y-d,x-d));
	// cout <<  upper_bound(ALL(xse), pll(y-d,x+d)) <<" "<<  lower_bound(ALL(xse), pll(y-d,x-d))<<endl;

	used[u] += upper_bound(ALL(xse), pll(y+d,x+d)) -  lower_bound(ALL(xse), pll(y+d,x-d));
	// cout <<  upper_bound(ALL(xse), pll(y+d,x+d)) <<" "<<  lower_bound(ALL(xse), pll(y+d,x-d))<<endl;

	// if(fout) cout<<"dfs2 "<<u<<endl;
	rep(i,4){
		ll xx = x+dx[i]*d;
		ll yy = y+dy[i]*d;
		auto it = lower_bound(ALL(yse), pll(xx,yy));
		if(*it == pll(xx,yy)) used[u]--;
	}
	for(auto&& y:vv[u]){
		dfs2(y);
	}
}

void mainmain(){
	int n;
	cin>>n;
	int a,b;
	cin>>a>>b;
	a--,b--;
	v=vector<pll>(n);
	used=vll(n);
	rep(i,n){
		cin>>v[i].F>>v[i].S;
		v[i] = {v[i].F+v[i].S, v[i].F-v[i].S};
		// cout<<"v "<<v[i].F<<" "<<v[i].S<<endl;
		xv[v[i].F].insert(pll(v[i].S, i));
		yv[v[i].S].insert(pll(v[i].F, i));
	}
	d = dist(v[a],v[b]);
	vv=vvint(n);
	// sort(ALL(v));
	// rep(i,n) se.insert({v[i],i});
	used=vll(n);
	dfs(a);
	// cout<<1<<endl;
	se=set<P>();
	
	// rep(i,n) swap(v[i].F,v[i].S);
	// rep(i,n) se.insert({v[i],i});
	// used=vll(n);
	// rep(i,n){
		// dfs(i);
	// }
	// cout<<2<<endl;
	// rep(i,n) swap(v[i].F,v[i].S);

	auto tmp = v;
	sort(ALL(tmp));
	yse=tmp;
	yse.PB({INFL,INFL});
	rep(i,n) swap(tmp[i].F,tmp[i].S);
	sort(ALL(tmp));
	xse=tmp;
	xse.PB({INFL,INFL});
	used=vll(n);
	// cout<<3<<endl;
	rep(i,n){
		sort(ALL(vv[i]));
		vv[i].erase(unique(ALL(vv[i])), vv[i].end());
	}
	ll ans = 0;
	dfs2(a);
	rep(i,n){
		ans += used[i];
	}
	cout<<ans/2<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 64212