There are N pinholes on the xy-plane. The i-th pinhole is located at (x_i,y_i).
We will denote the Manhattan distance between the i-th and j-th pinholes as d(i,j)(=|x_i-x_j|+|y_i-y_j|).
You have a peculiar pair of compasses, called Manhattan Compass.
This instrument always points at two of the pinholes.
The two legs of the compass are indistinguishable, thus we do not distinguish the following two states: the state where the compass points at the p-th and q-th pinholes, and the state where it points at the q-th and p-th pinholes.
When the compass points at the p-th and q-th pinholes and d(p,q)=d(p,r), one of the legs can be moved so that the compass will point at the p-th and r-th pinholes.
Initially, the compass points at the a-th and b-th pinholes.
Find the number of the pairs of pinholes that can be pointed by the compass.

-----Constraints-----
 - 2≦N≦10^5
 - 1≦x_i, y_i≦10^9
 - 1≦a < b≦N
 - When i ≠ j, (x_i, y_i) ≠ (x_j, y_j)
 - x_i and y_i are integers.

-----Input-----
The input is given from Standard Input in the following format:
N a b
x_1 y_1
:
x_N y_N

-----Output-----
Print the number of the pairs of pinholes that can be pointed by the compass.

-----Sample Input-----
5 1 2
1 1
4 3
6 1
5 5
4 8

-----Sample Output-----
4

Initially, the compass points at the first and second pinholes.
Since d(1,2) = d(1,3), the compass can be moved so that it will point at the first and third pinholes.
Since d(1,3) = d(3,4), the compass can also point at the third and fourth pinholes.
Since d(1,2) = d(2,5), the compass can also point at the second and fifth pinholes.
No other pairs of pinholes can be pointed by the compass, thus the answer is 4.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'N, a, b = list(map(int, input().split())); a -= 1; b -= 1\nP = []\nQ = []\nfor i in range(N):\n    x, y = list(map(int, input().split()))\n    P.append((x-y, x+y, i))\n    Q.append((x+y, x-y, i))\n\nd = max(abs(P[a][0] - P[b][0]), abs(P[a][1] - P[b][1]))\n\n*parent, = list(range(N))\ndef root(x):\n    if x == parent[x]:\n        return x\n    y = parent[x] = root(parent[x])\n    return y\ndef unite(x, y):\n    px = root(x); py = root(y)\n    if px < py:\n        parent[py] = px\n    else:\n        parent[px] = py\nC = [0]*N\nD = [0]*N\n\ndef check(P0, i0, j0):\n    return abs(P0[i0][0] - P0[j0][0]) == abs(P0[i0][1] - P0[j0][1])\n\ndef solve(P0):\n    P = P0[:]\n    P.sort()\n\n    s = t = 0; prev = -1\n    for i in range(N):\n        x, y, i0 = P[i]\n        while t < N and P[t][0] < x-d or (P[t][0] == x-d and P[t][1] <= y+d): t += 1\n        while s < N and (P[s][0] < x-d or (P[s][0] == x-d and P[s][1] < y-d)): s += 1\n        if s < t:\n            j0 = P[s][2]\n            unite(i0, j0)\n            if check(P0, i0, j0):\n                D[i0] += 1\n            else:\n                C[i0] += 1\n            if s < t-1:\n                j0 = P[t-1][2]\n                if check(P0, i0, j0):\n                    D[i0] += 1\n                    C[i0] += t-s-2\n                else:\n                    C[i0] += t-s-1\n            for j in range(max(prev, s), t-1):\n                unite(P[j][2], P[j+1][2])\n            prev = t-1\nsolve(P)\nsolve(Q)\n\nS = T = 0\nr = root(a)\nfor i in range(N):\n    if root(i) == r:\n        S += C[i]; T += D[i]\nprint((S + T//2))\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13585