This is an interactive problem. In the output section below you will see the information about flushing the output.

Bear Limak thinks of some hidden number — an integer from interval [2, 100]. Your task is to say if the hidden number is prime or composite.

Integer *x* &gt; 1 is called prime if it has exactly two distinct divisors, 1 and *x*. If integer *x* &gt; 1 is not prime, it's called composite.

You can ask up to 20 queries about divisors of the hidden number. In each query you should print an integer from interval [2, 100]. The system will answer "yes" if your integer is a divisor of the hidden number. Otherwise, the answer will be "no".

For example, if the hidden number is 14 then the system will answer "yes" only if you print 2, 7 or 14.

When you are done asking queries, print "prime" or "composite" and terminate your program.

You will get the Wrong Answer verdict if you ask more than 20 queries, or if you print an integer not from the range [2, 100]. Also, you will get the Wrong Answer verdict if the printed answer isn't correct.

You will get the Idleness Limit Exceeded verdict if you don't print anything (but you should) or if you forget about flushing the output (more info below).
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.
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.

<img align="middle" class="tex-formula" src="https://espresso.codeforces.com/ea790051c34ea7d2761cd9b096412ca7c647a173.png" style="max-width: 100.0%;max-height: 100.0%;"/>

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.

<img align="middle" class="tex-formula" src="https://espresso.codeforces.com/35c6952617fa94ec3e0ea8e63aa1c3c49b3ba420.png" style="max-width: 100.0%;max-height: 100.0%;"/>

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).
30
composite 4
59
prime 15
2
prime 16
7
prime 16
9
composite 3
13
prime 15
55
composite 6
89
prime 15
3
prime 16
4
composite 2
6
composite 4
8
composite 2
11
prime 15
12
composite 2
25
composite 4
36
composite 2
46
composite 10
47
prime 15
49
composite 5
51
composite 8
53
prime 15
59
prime 15
64
composite 2
81
composite 3
91
composite 7
93
composite 12
94
composite 16
95
composite 9
96
composite 2
97
prime 15
99
composite 3
100
composite 2
26
composite 7
94
composite 16
25
composite 4
46
composite 10
49
composite 5
82
composite 14
87
composite 11
85
composite 8
74
composite 13
86
composite 15
93
composite 12
58
composite 11
47
prime 15
22
composite 6
23
prime 15
62
composite 12
38
composite 9
91
composite 7
34
composite 8
95
composite 9
4
composite 2
16
composite 2
96
composite 2
69
composite 10
65
composite 7
6
composite 4
18
composite 4
from itertools import permutations

nlist = [4, 8, 15, 16, 23, 42]
print("? 1 2", flush=True)
a = int(input())
print("? 3 4", flush=True)
b = int(input())
print("? 5 5", flush=True)
c = int(input())
print("? 1 3", flush=True)
d = int(input())

for p in permutations(x):
    if p[0] * p[1] == a and p[2] * p[3] == b and p[4] * p[4] == c and p[0] * p[2] == d:
        print("!", ' '.join(map(str, p)), flush=True)
        break