시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 (추가 시간 없음) 512 MB35000.000%

## 문제

This is an interactive problem.

Alice has a black box which works with integers modulo $m = 10^{9} + 7$. If a user types a number $x$ on the keyboard of the box, the screen shows the number equal to the value of the polynomial $p (x) = (a_{d} x^{d} + a_{d - 1} x^{d - 1} + \ldots + a_{1} x^{1} + a_{0}) \bmod m$. The degree $d$ of the polynomial is unknown, as are its coefficients $a_{i}$. It is only known that $0 \le d \le 10$ and $a_d \ne 0$.

Alice can type several numbers $x$ and learn the values of the polynomial for these numbers. Help her find the degree $d$ of the polynomial. She can input an $x$ at most $d + 3$ times.

## 인터랙션 프로토콜

To learn the value of the polynomial for number $x$, print a line of the form "ask $x$" ($0 \le x < 10^{9} + 7$). As a result, you will get a line with the value $p (x)$, or, if you asked more than $d + 3$ such questions, you will get the number $-1$ instead of the value, and evaluation of your solution will terminate.

To give the answer, print a line of the form "degree $d$". After that, terminate your solution gracefully.

After printing each line, flush the output buffer, or you will get the outcome Idleness Limit Exceeded: this can be done by calling, for example, fflush (stdout) in C or C++, System.out.flush () in Java, flush (output) in Pascal, or sys.stdout.flush () in Python.

## 예제 입력 1


1000000006

7

34

98



## 예제 출력 1

ask 1

degree 2


## 노트

In each test, the degree and the coefficients of the polynomial $p (x)$ are chosen and fixed in advance.

In the example, which is also the first test in the testing system, $p (x) = x^2 + 1\,000\,000\,005$. All other tests were created as follows: first, the degree $d$ was chosen ($0 \le d \le 10$), and after that, one of the polynomials of such degree was chosen as $p (x)$ uniformly at random.

## 채점 및 기타 정보

• 예제는 채점하지 않는다.