Unenslaved puppy

A dog was attacked by angry bees. To hide from them, kind smurfs built $n$ domes.

Mathematically a dome is a semicircle with center at point $(po{s}_i,0)$ and radius $r_i$. It is impossible to pass through the wall of the dome. The dog and the beehive can be represented as two points $(x_1,y_1)$ and $(x_2,y_2)$. If a point is inside the dome, we consider it to be inside.

Help the dog find out whether it is safe. That is, whether the bees can reach the dog without crossing the walls of domes.

Input

The first line contains five integers $n$, $x_1$, $y_1$, $x_2$, $y_2$ $(1\le n\le 10^3,0\le x_1,y_1,x_2,y_2\le 10^3)$.

Each of the following $n$ lines contains two integers $po{s}_i$ and $r_i$ $(0\le po{s}_i\le 10^3,1\le r_i\le 10^3)$.

Output

If the bees can reach the dog without crossing the walls of domes, print «YES».

Otherwise, in the first line print «NO», and in the second line print the smallest index (starting from one) of the dome that separates the bee and the dog.

Examples

Note

Explanation for the first test:

Explanation for the second test:

Explanation for the third test: