#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){c=Getchar();rev|=c=='-';if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=100005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

int n,a,b,d,x[N],y[N],xx[N],yy[N];
pii px[N],py[N];
set<pii> s1[N],s2[N];
bool vis[N];
queue<int> q;

inline int dist(int a,int b)noexcept{return max(abs(x[a]-x[b]),abs(y[a]-y[b]));}
inline void makex(int x,int l,int r){
	int id=lower_bound(xx+1,xx+n+1,x)-xx;
	if(xx[id]!=x) return;
	set<pii>::iterator it=s1[id].lower_bound(mp(l,0));
	vector<pii> del(0);
	while(it!=s1[id].end()&&(*it).FF<=r)
		q.push((*it).SS),del.pb(*it),it++;
	for(auto i:del) s1[id].erase(i);
	del.clear();
}
inline void makey(int y,int l,int r){
	int id=lower_bound(yy+1,yy+n+1,y)-yy;
	if(yy[id]!=y) return;
	set<pii>::iterator it=s2[id].lower_bound(mp(l,0));
	vector<pii> del(0);
	while(it!=s2[id].end()&&(*it).FF<=r)
		q.push((*it).SS),del.pb(*it),it++;
	for(auto i:del) s2[id].erase(i);
	del.clear();
}
inline int calcx(int x,int l,int r){
	return upper_bound(px+1,px+n+1,mp(x,r))-lower_bound(px+1,px+n+1,mp(x,l));
}
inline int calcy(int y,int l,int r){
	return upper_bound(py+1,py+n+1,mp(y,r))-lower_bound(py+1,py+n+1,mp(y,l));
}

int main(){
#ifdef rqgao2014
	freopen("input.txt","r",stdin);
#endif
	read(n,a,b);
	for(int i=1;i<=n;i++){
		int a,b;read(a,b);
		x[i]=a+b,y[i]=a-b;
		xx[i]=x[i],yy[i]=y[i];
		px[i]=mp(x[i],y[i]);py[i]=mp(y[i],x[i]);
	}
	sort(px+1,px+n+1);
	sort(py+1,py+n+1);
	sort(xx+1,xx+n+1);
	sort(yy+1,yy+n+1);
	for(int i=1;i<=n;i++){
		int px=lower_bound(xx+1,xx+n+1,x[i])-xx;
		int py=lower_bound(yy+1,yy+n+1,y[i])-yy;
		s1[px].insert(mp(y[i],i));
		s2[py].insert(mp(x[i],i));
	}
	d=dist(a,b);
	q.push(a),q.push(b);
	while(!q.empty()){
		int i=q.front();q.pop();
		if(vis[i]) continue;
		vis[i]=1;
		makex(x[i]-d,y[i]-d,y[i]+d);
		makex(x[i]+d,y[i]-d,y[i]+d);
		makey(y[i]-d,x[i]-d+1,x[i]+d-1);
		makey(y[i]+d,x[i]-d+1,x[i]+d-1);
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
		if(!vis[i]) continue;
		ans+=calcx(x[i]-d,y[i]-d,y[i]+d);
		ans+=calcx(x[i]+d,y[i]-d,y[i]+d);
		ans+=calcy(y[i]-d,x[i]-d+1,x[i]+d-1);
		ans+=calcy(y[i]+d,x[i]-d+1,x[i]+d-1);
	}
	print(ans/2);
	return 0;
}

Measured memory_bytes: 23352