Hide

# Problem DDivide Doughnut

This is an interactive problem.

Khue and Hanh are obsessed with doughnuts although they are very much overweight. Over the last week, they worked very hard setting up the problems for ICPC Hanoi. To prepare for a long night of coding, they bought a super-large ring-shaped doughnut.

The perimeter of this doughnut is $1$ meter. They like things to be super precise so they divided the doughnut into ${10}^{9}$ parts, The outermost length of each of them is $1$ nanometer. They are numbered from $0$ to ${10}^{9}-1$.

This doughnut was topped with exactly $N$ ($N$ is even) sprinkles. No two sprinkles are in the same part. Khue and Hanh wants to divide the doughnut so that:

• Khue has $5 \cdot {10}^{8}$ consecutive parts. These parts have exactly $N/2$ sprinkles.

• Hanh has $5 \cdot {10}^{8}$ consecutive parts. These parts have exactly $N/2$ sprinkles.

In order to divide, they use an image processing program to count the number of sprinkles in consecutive parts.

You task is to divide the doughnut for Khue and Hanh without using the image processing program too many times. If there are multiple ways to divide the doughnut that satisfy the above conditions, you can answer with any of them.

## Interaction

First your program reads the total number of sprinkles $N$ $(1 \leq N \leq 100\, 000)$ from the standard input. It is guaranteed that $N$ is even. Then the following process repeats:

• Your program write to the standard output one of the following:

• QUERY u v $(0 \leq u,v < {10}^{9})$ — count the number of sprinkles from part $u$ to part $v$. Please note that: $u>v$ means count the number of sprinkles from part $u$ to ${10}^{9}-1$ and $0$ to $v$.

• YES x $(0 \leq x < {10}^{9})$ — You answer Khue should get parts from $x$ to $(x + 5 \cdot {10}^{8} - 1) \bmod {10}^{9}$.

• NO — You answer there is no division that satisfies Khue and Hanh.

• If your program asks a query, an integer $S$ will be available in the standard input. Your program should then read it.

You are allowed to interact at most $30 + \left\lfloor { \log _{2}{\sqrt {N}} } \right\rfloor$ times, including giving an answer.

## Communication example

Interpretation

4

There are $4$ sprinkles in this doughnut

QUERY 999999990 10

 You want to count sprinkles in parts from $999\, 999\, 990$ to $999\, 999\, 999$ and from $0$ to $10$

4

There are $4$ sprinkles in these parts

QUERY 0 10

4

There are $4$ sprinkles in parts $0$ to $10$

QUERY 0 5

You want to count sprinkles in parts $0$ to $5$

3

There are $3$ sprinkles in parts $0$ to $5$

QUERY 3 5

You want to count sprinkles in parts $3$ to $5$

1

There is $1$ sprinkle in parts $3$ to $5$

YES 3

 You answer a satisfied division is $3$ to $500\, 000\, 002$

## Note

When you write the solution for the interactive problem it is important to keep in mind that if you output some data it is possible that this data is first placed to some internal buffer and may be not directly transferred to the interactor. In order to avoid such situation you have to use special ‘flush’ operation each time you output some data. There are these ‘flush’ operations in standard libraries of almost all languages. For example, in C++ you may use fflush(stdout) or cout $<<$ flush (it depends on what do you use for output data — scanf/printf or cout). In Java you can use method ‘flush’ for output stream, for example, System.out.flush(). In Python you can use stdout.flush().