Given n set of points on a X-Y plane where the $ith$ point is denote by (Xi,Yi).

Also you are given a special point placed at coordinate (a,b).Determine the count of pairs of point such that the line segment joining them also passes through the special point.

Note: Consider line segment to be infinite from both ends. All the N points are distinct.

INPUT

First line contains 3 integers,  first integer N denoting the number of points and other two denoting the coordinates of the special point. (a , b)

Next N lines contain 2 space separated integers (Xi,Yi) denoting the coordinates of ith point.

Special point is not equal to any of the N points.

OUTPUT

The number of distinct pairs of point that is asked in the question.

CONSTRAINTS

$1 \leq N \leq 10^{5}$

$-10^{9} \leq X$_i,$Y$_i $\leq 10^{9}$