With numbers 1,2,3,4,5,6, if you can do enqueue() 5 times (you can choose any 5 of the 6 numbers and do enqueue() in any order) and dequeue() twice. How many different contents can remain in an initially empty queue? (For example, 2,3,4 is fessible, 3,4,6 is also possible)