You are a developer in a company. You call the bugs in your code as enemies. You maintain an array \(A\) of the list of enemies in decreasing order of their difficulty which implies the most difficult bug will be the first element of the array. Initially, there are no bugs in the code. You are given \(N\) tasks. Each task contains one of the following two types of operations:

\(1\ P\): Add a bug with difficulty \(P\) into array \(A\)
\(2\): Sort the array in decreasing order and print the difficulty of \((n / 3)^{th}\) bug in the sorted array, where \(n\) is the size of the array \(A\). If the number of bugs is less than \(3\), print Not enough enemies.

Input format

First line: An integer \(N\) denoting the number of tasks
Next \(N\) lines: One of the two types of operations

Output format

For every operation of type \(2\), print the difficulty of \((n / 3)^{th}\) bug in the sorted array, where \(n\) is the size of the array \(A\). If the number of bugs is less than \(3\), print Not enough enemies.

Constraints

\(1\le N \le 5 * 10^5 \)

\(1\le P \le 10^9 \)