#include <bits/stdc++.h>
// created [2020/01/04] 03:27:59
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto N = in<int>();
    const auto a = in<int>() - 1, b = in<int>() - 1;
    std::vector<ll> xs(N), ys(N);
    for (int i = 0; i < N; i++) {
        xs[i] = in<ll>(), ys[i] = in<ll>();
        std::tie(xs[i], ys[i]) = std::pair<ll, ll>{xs[i] - ys[i], xs[i] + ys[i]};
    }
    auto Linf  = [&](const ll x1, const ll y1, const ll x2, const ll y2) { return std::max(std::abs(x1 - x2), std::abs(y1 - y2)); };
    const ll L = Linf(xs[a], ys[a], xs[b], ys[b]);
    using pli  = std::pair<ll, int>;
    std::map<ll, std::set<pli>> von;
    std::map<ll, std::set<pli>> hon;
    for (int i = 0; i < N; i++) { von[xs[i]].insert({ys[i], i}); }
    for (int i = 0; i < N; i++) { hon[ys[i]].insert({xs[i], i}); }
    std::vector<int> Rs{a, b};
    std::queue<int> Q;
    Q.push(a), Q.push(b);
    von[xs[a]].erase({ys[a], a}), hon[ys[a]].erase({xs[a], a});
    von[xs[b]].erase({ys[b], b}), hon[ys[b]].erase({xs[b], b});
    while (not Q.empty()) {
        const int v = Q.front();
        Q.pop();
        const ll x = xs[v], y = ys[v];
        for (int d = 0; d < 4; d++) {  // RULD
            if (d == 0) {
                const ll nx = x + L;
                const ll ym = y - L, yM = y + L;
                auto it = von[nx].lower_bound({ym, 0});
                std::vector<int> nxt;
                for (; it != von[nx].end(); it++) {
                    const ll ny = it->first;
                    const int i = it->second;
                    if (ny > yM) { break; }
                    nxt.push_back(i);
                    SHOW(v, i);
                }
                for (const int n : nxt) {
                    const ll x = xs[n], y = ys[n];
                    von[x].erase({y, n}), hon[y].erase({x, n});
                    Rs.push_back(n);
                    Q.push(n);
                }
            } else if (d == 1) {
                const ll ny = y + L;
                const ll xm = x - L, xM = x + L;
                auto it = hon[ny].lower_bound({xm, 0});
                std::vector<int> nxt;
                for (; it != hon[ny].end(); it++) {
                    const ll nx = it->first;
                    const int i = it->second;
                    if (nx > xM) { break; }
                    nxt.push_back(i);
                    SHOW(v, i);
                }
                for (const int n : nxt) {
                    const ll x = xs[n], y = ys[n];
                    von[x].erase({y, n}), hon[y].erase({x, n});
                    Rs.push_back(n);
                    Q.push(n);
                }
            } else if (d == 2) {
                const ll nx = x - L;
                const ll ym = y - L, yM = y + L;
                auto it = von[nx].lower_bound({ym, 0});
                std::vector<int> nxt;
                for (; it != von[nx].end(); it++) {
                    const ll ny = it->first;
                    const int i = it->second;
                    if (ny > yM) { break; }
                    nxt.push_back(i);
                    SHOW(v, i);
                }
                for (const int n : nxt) {
                    const ll x = xs[n], y = ys[n];
                    von[x].erase({y, n}), hon[y].erase({x, n});
                    Rs.push_back(n);
                    Q.push(n);
                }
            } else {
                const ll ny = y - L;
                const ll xm = x - L, xM = x + L;
                auto it = hon[ny].lower_bound({xm, 0});
                std::vector<int> nxt;
                for (; it != hon[ny].end(); it++) {
                    const ll nx = it->first;
                    const int i = it->second;
                    if (nx > xM) { break; }
                    nxt.push_back(i);
                    SHOW(v, i);
                }
                for (const int n : nxt) {
                    const ll x = xs[n], y = ys[n];
                    von[x].erase({y, n}), hon[y].erase({x, n});
                    Rs.push_back(n);
                    Q.push(n);
                }
            }
        }
    }
    SHOW(Rs);
    std::map<ll, std::vector<ll>> hs, vs;
    for (int i = 0; i < N; i++) { vs[xs[i]].push_back(ys[i]); }
    for (int i = 0; i < N; i++) { hs[ys[i]].push_back(xs[i]); }
    for (auto& p : hs) { std::sort(p.second.begin(), p.second.end()); }
    for (auto& p : vs) { std::sort(p.second.begin(), p.second.end()); }
    ll ans = 0;
    for (const int v : Rs) {
        const ll x = xs[v], y = ys[v];
        ll cnt = 0;
        for (int d = 0; d < 4; d++) {  // RULD
            if (d == 0) {
                const ll nx = x + L;
                const ll ym = y - L, yM = y + L;
                cnt += std::upper_bound(vs[nx].begin(), vs[nx].end(), yM) - std::lower_bound(vs[nx].begin(), vs[nx].end(), ym);
            } else if (d == 1) {
                const ll ny = y + L;
                const ll xm = x - L, xM = x + L;
                cnt += std::upper_bound(hs[ny].begin(), hs[ny].end(), xM) - std::lower_bound(hs[ny].begin(), hs[ny].end(), xm);
            } else if (d == 2) {
                const ll nx = x - L;
                const ll ym = y - L, yM = y + L;
                cnt += std::upper_bound(vs[nx].begin(), vs[nx].end(), yM) - std::lower_bound(vs[nx].begin(), vs[nx].end(), ym);
            } else {
                const ll ny = y - L;
                const ll xm = x - L, xM = x + L;
                cnt += std::upper_bound(hs[ny].begin(), hs[ny].end(), xM) - std::lower_bound(hs[ny].begin(), hs[ny].end(), xm);
            }
        }
        cnt -= std::upper_bound(vs[x - L].begin(), vs[x - L].end(), y - L) - std::lower_bound(vs[x - L].begin(), vs[x - L].end(), y - L);
        cnt -= std::upper_bound(vs[x - L].begin(), vs[x - L].end(), y + L) - std::lower_bound(vs[x - L].begin(), vs[x - L].end(), y + L);
        cnt -= std::upper_bound(vs[x + L].begin(), vs[x + L].end(), y - L) - std::lower_bound(vs[x + L].begin(), vs[x + L].end(), y - L);
        cnt -= std::upper_bound(vs[x + L].begin(), vs[x + L].end(), y + L) - std::lower_bound(vs[x + L].begin(), vs[x + L].end(), y + L);
        ans += cnt;
    }
    outln(ans / 2);
    return 0;
}


Measured memory_bytes: 76536