Byteasar bought his son Bytie a set of blocks numbered from to and arranged them in a row in a certain order. Bytie's goal is to rearrange the blocks so that they are ordered naturally, from the smallest number to the largest. However, the only moves Bytie is allowed to make are:
putting the last block at the very beginning (move a), and
putting the third block at the very beginning (move b).
Help Bytie by writing a program that tells whether a given arrangement of blocks can be properly reordered, and tells the right sequence of moves if it is.
In the first line of the standard input there is a single integer , . In the second line there are integers from the range to , separated by single spaces. No number appears twice, and thus they represent the initial arrangement of the blocks.
If there is no sequence of moves leading to an arrangement with increasing blocks' numbers, your program should print out "NIE DA SIE" (there is no way in Polish), without the quotation marks.
Otherwise there should be a single integer (), denoting the number of operations, in the first line. An operation is a -fold execution of either a or b move.
If , then there should be a sequence of integers with either a or b appended in the second line. Thus (for ) denotes the -fold execution of the move a. Analogously, (for ) denotes the -fold execution of the move b.
Furthermore, the characters appended to the numbers in the second line have to alternate.
Should there be more than one solution, your program is free to pick one arbitrarily.
如果没有一种方案能将积木按照编号从小到大的顺序重新排列，你应当输出 NIE DA SIE（波兰语中的 There is no way）。