E. Entropy Evasion
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Last week, you were contacted by aliens. Strangely, no one you tell seems to believe you – this is likely some form of alien brainwashing. Nonetheless, you decided to reply to the message, and with the help of a few video tutorials, a rocket with a picture of you and your cat is currently long underway to the aliens. Perhaps more importantly, the rocket also contains an array of $$$n$$$ bits, all set to $$$0$$$. This was specifically requested by the aliens: "State your intentions. Send an array of bits set to $$$1$$$ to indicate you wish to remain peaceful. In any other case, we will destroy your planet." Wait, what? Set to $$$1$$$? Whoops.

Luckily, the rocket is equipped with a Bit Array Protection Controller (BAPC). The BAPC can be opened up to expose a contiguous section of the bit array to interstellar radiation, independently setting each of the exposed bits to either $$$0$$$ or $$$1$$$, each with a probability of $$$50\%$$$. Your idea is to exploit this randomness to set most of the bits in the array to $$$1$$$. The aliens sounded serious, but not that serious, so setting at least $$$70\%$$$ of the bits to $$$1$$$ is probably fine. Unfortunately, the rocket has almost reached its destination, so you can open up the BAPC at most $$$125$$$ times before the aliens read the array. Send the correct commands to the BAPC to ensure at least $$$70\%$$$ of the bits are set to $$$1$$$.

Interaction

This is an interactive problem. Your submission will be run against an interactor, which reads from the standard output of your submission and writes to the standard input of your submission. This interaction needs to follow a specific protocol:

The interactor first sends one line with an integer $$$n$$$ ($$$1\leq n\leq 1000$$$), the length of the bit array $$$v$$$.

Then, your program should send at most $$$125$$$ commands to set at least $$$70$$$% of the bits to $$$1$$$. Each command is sent by printing one line of the form "$$$\ell$$$ $$$r$$$" ($$$1\leq \ell \leq r\leq n$$$), which will expose the bits in positions $$$[\ell, r]$$$ to interstellar radiation. The interactor will respond with two lines. The first line consists of $$$n$$$ integers $$$v_1, v_2, \ldots, v_n$$$ ($$$v_i \in \{0,1\}$$$ for each $$$i$$$), the new state of the array. The second line contains a single integer $$$p$$$ ($$$0 \leq p \leq 100$$$), the current percentage of ones, rounded down.

When the percentage of ones is at least $$$70$$$, the interaction will stop. Sending any additional commands after this point or using more than $$$125$$$ commands will result in a wrong answer.

For each of your submissions, the interactor uses a new random seed. The interactor is not adaptive. Your submission will be run on at most $$$100$$$ test cases.

Make sure you flush the buffer after each write.

A testing tool is provided to help you develop your solution.

Examples
Input
4

0 0 0 0
0

1 1 1 0
75
Output

1 4


1 3


Input
3

1 0 0
33

1 0 0
33

1 1 0
66

1 1 1
100
Output

1 3


2 2


2 2


3 3