靠北交大 2.0

LeetCode #9487
assume there are n tolerance-testing posts
the posts form total order set(i.e. tolerance of i-th post can be measured as an integer number a_i )
to test the tolerance of CowBei NCTU 2.0
find the maximum and minimum tolerance of CowBei NCTU 2.0

this is an interactive problem.
for each post you post, you will receive the approvals and rejections your post get

Constraints:
1 <= n <= 94879487122387
you can use up to 87 queries before printing your answer

IO:
the first contains a single integer n, the numbers of your test posts
following by n numbers, sorted array of your test posts' score
for the interactive part, print "PPPPPOST x\n" where x is the tolerance number of the test you want to make
you will receive F approvals and UCK rejections with the format "F UCK F UCK "
when you want to answer the question, print "This is an O(n) problem but I will get AC by guess, {min} {max} "
if you think the answer doesn't exist or can't be determined, print "I will get WA"

LeetCode #9488 find the problem setter ><