This is an interactive problem. Remember that your program must flush the output buffer every time after printing. To flush the output buffer, you can use fflush(stdout) in C++, system.out.flush() in Java, stdout.flush() in Python, or flush(output) in Pascal. If you are using another programming language, check its documentation for how to perform this operation.
Vasya claims that he has invented a sorting algorithm for an $$$n$$$-element array $$$a$$$ (where all elements are pairwise distinct) that makes less than $$$\lceil \log_2 (n!)\rceil$$$ comparisons!
Vasya will ask you no more than $$$\lceil \log_2 (n!)\rceil - 1$$$ queries of the form: compare elements $$$a_i$$$ and $$$a_j$$$. Vasya claims that these queries are sufficient to uniquely determine the permutation of the positions of the array $$$a$$$ from the smallest element to the largest: $$$\operatorname{ord}_1, \operatorname{ord}_2, \dots, \operatorname{ord}_n$$$. Your task is to find a permutation of positions that differs from Vasya's permutation but is consistent with all of Vasya's queries.
Initially, the jury's program will send a single integer $$$n$$$ ($$$3 \le n \le 18$$$) — the size of the array.
Then, the jury's program will send no more than $$$\lceil \log_2 (n!)\rceil - 1$$$ queries in the following format:
For each query, your program must output < if $$$a_i \lt a_j$$$, and > otherwise.
After that, the jury's program will send its answer in the following format:
In response, your program must output a permutation that differs from the jury's permutation and is consistent with all previous queries, in the same format. If there are multiple possible permutations, output any of them. Please pay attention that you should not output the array $$$a$$$!
If your answer is correct, the jury's program will send the string CORRECT on a separate line, indicating that you can terminate the program. If the answer is incorrect, the jury's program will send the string ERROR on a separate line.
If your program violates the format of the queries, the jury will respond with the string ERROR. In this case, your program should terminate immediately to receive a Wrong answer verdict. Otherwise, you may receive an arbitrary verdict because your solution will continue to read from a closed stream.
Remember to flush the output buffer every time you print something!
4 ? 2 1 ? 4 3 ? 4 2 ? 1 4 ! 1 3 4 2 CORRECT
> > < < ! 3 1 4 2
Note that spaces in the examples are added only for readability. When checking solutions, the interactor will not output empty lines.