Sheep and Coyotes

A square $1000 \times 1000$ field contains several sheep. A coyote enters the field at some point on the south boundary and eats the sheep closest to its entry point; if several sheep are equally close, it picks one of them arbitrarily. Having eaten, the sated coyote leaves the field.

Determine which sheep may possibly be eaten by the coyote.

Assume the southwest corner of the field is at $(0.00, 0.00)$, the northwest corner at $(0.00, 1000.00)$, the northeast corner at $(1000.00, 1000.00)$, and the southeast corner at $(1000.00, 0.00)$. Thus the coyote enters at some point on the south edge $y = 0$ with $0 \le x \le 1000$.

The first line contains the number of sheep $n$ ($1 \le n \le 1000$). For each sheep, two lines follow: the first gives its $x$ coordinate and the second its $y$ coordinate. Every coordinate is between $0.00$ and $1000.00$ and is given to two decimal places.

For each sheep that might be eaten, print one line in the form The sheep at (x, y) might be eaten., where $x$ and $y$ are the sheep's coordinates to two decimal places (printed exactly as given in the input). Print the sheep sorted by increasing $x$; if two sheep share the same $x$, sort them by increasing $y$. If several sheep share identical coordinates, print one line for each.