#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sotate[pos.fi+d](all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define int long long

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

map<int, set<P> > tate, yoko;
map<int, vector<P> > X, Y;

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, a, b;
    cin >> n >> a >> b;
    --a, --b;
    if(a > b) swap(a,b);
    vp vec(n);
    rep(i,n){
        int x, y;
        cin >> x >> y;
        vec[i] = P(x-y, x+y);
        // spair(vec[i]);
        tate[x-y].insert(P(x+y,i)), yoko[x+y].insert(P(x-y,i));
        X[x-y].pb(P(x+y,i)), Y[x+y].pb(P(x-y,i));
    }
    each(val,X){
        sort(all(val.se));
    }
    each(val,Y){
        sort(all(val.se));
    }
    queue<int> que;
    que.push(a);
    tate[vec[a].fi].erase(P(vec[a].se,a)), yoko[vec[a].se].erase(P(vec[a].fi,a));
    int d = max(abs(vec[a].fi-vec[b].fi),abs(vec[a].se-vec[b].se));
    int ans = 0;
    while(!que.empty()){
        int p = que.front();
        que.pop();
        // cout << d << "\n";
        // show(p);
        P pos = vec[p];
        // set<P>& tate[pos.fi-d] = tate[pos.fi-d], tate[pos.fi+d] = tate[pos.fi+d];
        auto it = tate[pos.fi-d].lower_bound(P(pos.se-d,-INF));
        auto ed = tate[pos.fi-d].upper_bound(P(pos.se+d,INF));
        // show(upper_bound(all(X[pos.fi-d]),P(pos.se+d,INF)) - lower_bound(all(X[pos.fi-d]),P(pos.se-d,-INF)));
        ans += upper_bound(all(X[pos.fi-d]),P(pos.se+d,INF)) - lower_bound(all(X[pos.fi-d]),P(pos.se-d,-INF));
        while(it != ed){
            // show(it->se);
            yoko[vec[it->se].se].erase(P(vec[it->se].fi,it->se));
            que.push(it->se);
            it = tate[pos.fi-d].erase(it);
        }
        it = tate[pos.fi+d].lower_bound(P(pos.se-d,-INF));
        ed = tate[pos.fi+d].upper_bound(P(pos.se+d,INF));
        // show(upper_bound(all(X[pos.fi+d]),P(pos.se+d,INF)) - lower_bound(all(X[pos.fi+d]),P(pos.se-d,-INF)));
        ans += upper_bound(all(X[pos.fi+d]),P(pos.se+d,INF)) - lower_bound(all(X[pos.fi+d]),P(pos.se-d,-INF));
        while(it != ed){
            // show(it->se);
            yoko[vec[it->se].se].erase(P(vec[it->se].fi,it->se));
            que.push(it->se);
            it = tate[pos.fi+d].erase(it);
        }
        // set<P>& yoko[pos.se-d] = yoko[pos.se-d], yoko[pos.se+d] = yoko[pos.se+d];
        it = yoko[pos.se-d].upper_bound(P(pos.fi-d,-INF));
        ed = yoko[pos.se-d].lower_bound(P(pos.fi+d,INF));
        // show(lower_bound(all(Y[pos.se-d]),P(pos.fi+d,-INF)) - upper_bound(all(Y[pos.se-d]),P(pos.fi-d,INF)));
        ans += lower_bound(all(Y[pos.se-d]),P(pos.fi+d,-INF)) - upper_bound(all(Y[pos.se-d]),P(pos.fi-d,INF));
        while(it != ed){
            // show(it->se);
            if(tate[vec[it->se].fi].count(P(vec[it->se].se,it->se))){
                tate[vec[it->se].fi].erase(P(vec[it->se].se,it->se));
            }
            que.push(it->se);
            it = yoko[pos.se-d].erase(it);
        }
        it = yoko[pos.se+d].upper_bound(P(pos.fi-d,-INF));
        ed = yoko[pos.se+d].lower_bound(P(pos.fi+d,INF));
        // show(lower_bound(all(Y[pos.se+d]),P(pos.fi+d,-INF)) - upper_bound(all(Y[pos.se+d]),P(pos.fi-d,INF)));
        ans += lower_bound(all(Y[pos.se+d]),P(pos.fi+d,-INF)) - upper_bound(all(Y[pos.se+d]),P(pos.fi-d,INF));
        while(it != ed){
            // show(it->se);
            if(tate[vec[it->se].fi].count(P(vec[it->se].se,it->se))){
                tate[vec[it->se].fi].erase(P(vec[it->se].se,it->se));
            }
            que.push(it->se);
            it = yoko[pos.se+d].erase(it);
        }
        // show(ans);
    }
    cout << ans/2 << "\n";
    return 0;
}


Measured memory_bytes: 83200