Codeforces Round 878 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

constructive algorithms

interactive

math

meet-in-the-middle

probabilities

*2200

No tag edit access

The problem statement has recently been changed. View the changes.

×
G1. In Search of Truth (Easy Version)

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe only difference between easy and hard versions is the maximum number of queries. In this version, you are allowed to ask at most $$$2023$$$ queries.

This is an interactive problem.

You are playing a game. The circle is divided into $$$n$$$ sectors, sectors are numbered from $$$1$$$ to $$$n$$$ in some order. You are in the adjacent room and do not know either the number of sectors or their numbers. There is also an arrow that initially points to some sector. Initially, the host tells you the number of the sector to which the arrow points. After that, you can ask the host to move the arrow $$$k$$$ sectors counterclockwise or clockwise at most $$$2023$$$ times. And each time you are told the number of the sector to which the arrow points.

Your task is to determine the integer $$$n$$$ — the number of sectors in at most $$$2023$$$ queries.

It is guaranteed that $$$1 \le n \le 10^6$$$.

Input

The input consists of a single integer $$$x$$$ ($$$1 \le x \le n$$$) — the number of the initial sector.

Output

After you determine the integer $$$n$$$ — the number of sectors, you should output "! n" ($$$1 \le n \le 10^6$$$). After that the program should immediately terminate.

Note that, printing the answer does not count as a query.

It is guaranteed that the integer $$$n$$$ and the numbers of the sectors are fixed initially and will not be changed by the jury program depending on the queries.

Interaction

After reading the description of the input, you may ask queries. Queries can be of two types:

- "+ k" ($$$0 \le k \le 10^9$$$) — ask to move the arrow $$$k$$$ sectors clockwise.
- "- k" ($$$0 \le k \le 10^9$$$) — ask to move the arrow $$$k$$$ sectors counterclockwise.

After each query, you should read an integer $$$x$$$ ($$$1 \le x \le n$$$) — the number of the current sector to which the arrow points.

You are allowed to make at most $$$2023$$$ queries in total.

If you make too many queries, you will get Wrong answer.

After printing a query or the answer, do not forget to output a the end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

- fflush(stdout) or cout.flush() in C++;
- System.out.flush() in Java;
- flush(output) in Pascal;
- stdout.flush() in Python;
- see the documentation for other languages.

Example

Input

1 5 6 7 2 10 9 8 4 3 1

Output

+ 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 ! 10

Note

Hacks

To hack, use the following test format.

In the first line, output a single integer $$$n$$$ ($$$1 \le n \le 10^6$$$) — the number of sectors.

In the second line, output $$$n$$$ different integers $$$1 \le a_1, a_2, \dots, a_n \le n$$$ — the numbers of the sectors in clockwise order, the arrow initially points to the sector with the number $$$a_1$$$.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/24/2024 19:53:27 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|