IN JAVA

Bessie the cow has escaped and is hiding on a ridge covered with tall

grass. Farmer John, in an attempt to recapture Bessie, has decided to

crawl through the grass on his hands and knees so he can approach

undetected. Unfortunately, he is having trouble spotting Bessie from this

vantage point. The grass in front of Farmer John looks like a string of $N$

$(1N50,000)$ parentheses; for example:

$((0))(0)$

Farmer John knows that Bessie's hind legs look just like an adjacent pair

of left parentheses $(,$ and that her front legs look exactly like a pair of

adjacent right parentheses $)).$ Bessie's location can therefore be

described by a pair of indices $xyN(1N50,000)x$