# Bear and Prime 100

## 输入输出格式

### 输入格式

After each query you should read one string from the input. It will be "yes" if the printed integer is a divisor of the hidden number, and "no" otherwise.

### 输出格式

Up to \$ 20 \$ times you can ask a query — print an integer from interval \$ [2,100] \$ in one line. You have to both print the end-of-line character and flush the output. After flushing you should read a response from the input. In any moment you can print the answer "prime" or "composite" (without the quotes). After that, flush the output and terminate your program. To flush you can use (just after printing an integer and end-of-line): - fflush(stdout) in C++; - System.out.flush() in Java; - stdout.flush() in Python; - flush(output) in Pascal; - See the documentation for other languages. Hacking. To hack someone, as the input you should print the hidden number — one integer from the interval \$ [2,100] \$ . Of course, his/her solution won't be able to read the hidden number from the input.

## 输入输出样例

### 输入样例 #1

``````yes
no
yes
``````

### 输出样例 #1

``````2
80
5
composite
``````

### 输入样例 #2

``````no
yes
no
no
no
``````

### 输出样例 #2

``````58
59
78
78
2
prime
``````

## 说明

The hidden number in the first query is \$ 30 \$ . In a table below you can see a better form of the provided example of the communication process. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF679A/b5d048578748c4adde3d49c36a749660a61701b4.png) The hidden number is divisible by both \$ 2 \$ and \$ 5 \$ . Thus, it must be composite. Note that it isn't necessary to know the exact value of the hidden number. In this test, the hidden number is \$ 30 \$ . ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF679A/f54f8d5adb5e9403a147185e0d841ee7fbfd7d7b.png) \$ 59 \$ is a divisor of the hidden number. In the interval \$ [2,100] \$ there is only one number with this divisor. The hidden number must be \$ 59 \$ , which is prime. Note that the answer is known even after the second query and you could print it then and terminate. Though, it isn't forbidden to ask unnecessary queries (unless you exceed the limit of \$ 20 \$ queries).