There is a bag-like data structure, supporting two operations: Given a sequence of operations with return values, you're going to guess the data structure. It is a stack (Last-In, First-Out), a queue (First-In, First-Out), a priority-queue (Always take out larger elements first) or something else that you can hardly imagine! \InputFile There are several test cases. Each test case begins with a line containing a single integer \textbf{n} (\textbf{1} ≤ \textbf{n} ≤ \textbf{1000}). Each of the next n lines is either a type-\textbf{1} command, or an integer \textbf{2} followed by an integer \textbf{x}. That means after executing a type-\textbf{2} command, we get an element \textbf{x} without error. The value of \textbf{x} is always a positive integer not larger than \textbf{100}. The input is terminated by end-of-file (\textbf{EOF}). The size of input file does not exceed \textbf{1} MB. \OutputFile For each test case, output one of the following: