#include<bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
// Output
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define yes printf("YES\n")
#define no printf("NO\n")
#define lin printf("\n")
// Iterator
#define lp(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// Debug
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define what(x) cerr << #x << " : " << x << "\n"
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
	cerr << *it << " = " << a << "\n";
	err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int,int>
//#define pli pair<ll,int>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
#define M 1000000007
#define N 200005  //check the limits, man
const ll INF = 1e12;
queue<ii> pq;
map<int,vi> sum,diff;
map<int,set<int> > sm,dm;
int main()
{
    int n,a,b,x,y,i,j,k;
    in(n);
    in2(a,b);
    vii vp(n);
    rep(i,n)
        in2(vp[i].F,vp[i].S);
    a--,b--;
    pq.push({vp[a].F,vp[a].S});
    int d=abs(vp[a].F-vp[b].F)+abs(vp[a].S-vp[b].S);
    set<int> sv,dv;
    rep(i,n)
    {
        x=vp[i].F,y=vp[i].S;
        sum[x+y].pb(x);
        diff[x-y].pb(x);
        if(i!=a)
            sm[x+y].insert(x),dm[x-y].insert(x);
        sv.insert(x+y);
        dv.insert(x-y);
    }
    set<int> :: iterator itr;
    itr=sv.begin();
    while(itr!=sv.end())
    {
        a=(*itr);
        sort(all(sum[a]));
        itr++;
    }
    itr=dv.begin();
    while(itr!=dv.end())
    {
        a=(*itr);
        sort(all(diff[a]));
        itr++;
    }
    ll ans=0;
    ii temp;
    set<int> :: iterator ptr;
    while(!pq.empty())
    {
        temp=pq.front();
        pq.pop();
        x=temp.F,y=temp.S;
        //debug(x,y);
        a=x+y+d;
        i=lower(sum[a],x);
        j=upper(sum[a],x+d);
        ans+=(j-i);
        ptr=sm[a].lower_bound(x);
        while(ptr!=sm[a].end())
        {
            b=(*ptr);
            ptr++;
            if(b<=x+d)
                sm[a].erase(b),pq.push({b,a-b}),dm[2*b-a].erase(b);
            else
                break;
        }
        a=x+y-d;
        i=lower(sum[a],x-d+1);
        j=upper(sum[a],x-1);
        ans+=(j-i);
        ptr=sm[a].lower_bound(x-d+1);
        while(ptr!=sm[a].end())
        {
            b=(*ptr);
            ptr++;
            if(b<=x-1)
                sm[a].erase(b),pq.push({b,a-b}),dm[2*b-a].erase(b);
            else
                break;
        }
        a=x-y+d;
        i=lower(diff[a],x);
        j=upper(diff[a],x+d-1);
        ans+=(j-i);
        ptr=dm[a].lower_bound(x);
        while(ptr!=dm[a].end())
        {
            b=(*ptr);
            ptr++;
            if(b<=x+d-1)
                dm[a].erase(b),pq.push({b,b-a}),sm[2*b-a].erase(b);
            else
                break;
        }
        a=x-y-d;
        i=lower(diff[a],x-d);
        j=upper(diff[a],x-1);
        ans+=(j-i);
        ptr=dm[a].lower_bound(x-d);
        while(ptr!=dm[a].end())
        {
            b=(*ptr);
            ptr++;
            if(b<=x-1)
                dm[a].erase(b),pq.push({b,b-a}),sm[2*b-a].erase(b);
            else
                break;
        }
//        debug(x,y,ans);
    }
    ans/=2;
    llout(ans);
}





Measured memory_bytes: 86912