Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Donkey and Stars

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn the evenings Donkey would join Shrek to look at the stars. They would sit on a log, sipping tea and they would watch the starry sky. The sky hung above the roof, right behind the chimney. Shrek's stars were to the right of the chimney and the Donkey's stars were to the left. Most days the Donkey would just count the stars, so he knew that they are exactly *n*. This time he wanted a challenge. He imagined a coordinate system: he put the origin of the coordinates at the intersection of the roof and the chimney, directed the *OX* axis to the left along the roof and the *OY* axis — up along the chimney (see figure). The Donkey imagined two rays emanating from he origin of axes at angles α_{1} and α_{2} to the *OX* axis.

Now he chooses any star that lies strictly between these rays. After that he imagines more rays that emanate from this star at the same angles α_{1} and α_{2} to the *OX* axis and chooses another star that lies strictly between the new rays. He repeats the operation as long as there still are stars he can choose between the rays that emanate from a star.

As a result, the Donkey gets a chain of stars. He can consecutively get to each star if he acts by the given rules.

Your task is to find the maximum number of stars *m* that the Donkey's chain can contain.

Note that the chain must necessarily start in the point of the origin of the axes, that isn't taken into consideration while counting the number *m* of stars in the chain.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of stars. The second line contains simple fractions representing relationships "*a*/*b* *c*/*d*", such that and (0 ≤ *a*, *b*, *c*, *d* ≤ 10^{5}; ; ; ). The given numbers *a*, *b*, *c*, *d* are integers.

Next *n* lines contain pairs of integers *x*_{i}, *y*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ 10^{5})— the stars' coordinates.

It is guaranteed that all stars have distinct coordinates.

Output

In a single line print number *m* — the answer to the problem.

Examples

Input

15

1/3 2/1

3 1

6 2

4 2

2 5

4 5

6 6

3 4

1 6

2 1

7 4

9 3

5 3

1 3

15 5

12 4

Output

4

Note

In the sample the longest chain the Donkey can build consists of four stars. Note that the Donkey can't choose the stars that lie on the rays he imagines.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/22/2018 19:29:59 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|