There are points given on the plane. In addition, two base points are given.
Find the maximum number of points (excluding the base points) that can be placed in a strip formed by a pair of parallel lines, each passing through one of the base points. If a point lies on one of the lines, it is counted.
The first line contains one integer (0 \leq n \leq 10000) — the number of points. The second line contains the coordinates of the two base points in the format x_1\ y_1\ x_2\ y_2. Each of the next lines contains the coordinates of a point in the format . All coordinates are integers with absolute value not exceeding . The base points differ in at least one coordinate.
Print one integer — the maximum number of points that can be contained in a strip formed by a pair of optimally drawn parallel lines passing through the base points.
Example 1