PROGRAMMING:Find the stack in and stack out sequence of sequence a

The input sequence is 1,2,3,4,..., N. judge whether the sequence a can be obtained through a stack, and output the process of stack in and stack out.
###Input format:
Each group has two lines of input:
The first line is a positive integer n, 1 < = n < = 100;
The second line is the sequence a, which has n integers, indicating the target sequence to be obtained. The sequence is 1 ~ n permutation, the topic guarantees that the length of the sequence is n, the integers in the sequence are not the same, and the integers are in the interval [1, n].
There can be multiple sets of inputs.
###Output format:
For each group of input, first output a line, if you can get sequence a through the stack, then output 'yes', and then output the operation of getting sequence a into the stack and out of the stack.
If we can't get sequence a, we just need to output 'no'.
###Input example:
Here is a set of inputs. For example:
```in
five
2 1 5 4 3
five
2 1 5 3 4
```
###Output example:
The corresponding output is given here. For example:
```out
YES
push 1
push 2
pop 2
pop 1
push 3
push 4
push 5
pop 5
pop 4
pop 3
NO
```







answer：If there is no answer, please comment