This is an interactive problem.

An arithmetic expression is constructed using $$$N$$$ ($$$7 \leq N \leq 40$$$) distinct integers from $$$1$$$ to $$$N$$$, arranged in a certain order with operation symbols of "+", "-", and "*" placed between them. The number of "*" operators does not exceed $$$11$$$. Each operation occurs at least once.

Your goal is to guess the original expression.

The participant's program can swap two numbers or two operations in the expression and then compute the resulting value. Each subsequent query is applied to the expression obtained after executing the previous query.

Initially, the jury's program outputs the number $$$N$$$ and the result of the original expression on the next line. For each participant's query, the jury's program will execute it and output the value of the resulting expression. The participant's program ends with a final output of the answer. Each line of the participant's query should contain one of the following forms:

• "N $$$a$$$ $$$b$$$" — swap the two numbers located at positions $$$a$$$ and $$$b$$$ ($$$1 \leq a, b \leq N$$$, $$$a \neq b$$$);
• "O $$$c$$$ $$$d$$$" — swap the two operations located at positions $$$c$$$ and $$$d$$$ ($$$1 \leq c, d \leq N - 1$$$, $$$c \neq d$$$);
• "A $$$e$$$" — output the answer, where $$$e$$$ represents the originakarithmetic expression.

The number of queries must not exceed $$$750$$$. The jury's program is not adaptive to the participant's program output.