Points

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem Statement

Maintain a set of integer points on the plane, initially empty. There are $n$ requests:

• add x y: add point $(x,y)$. It is guaranteed not to exist yet.
• remove x y: remove point $(x,y)$. It is guaranteed to exist.
• find x y: among all marked points $(x',y')$ with $x'>x$ and $y'>y$, choose the point with smallest $x'$. If several points have that $x'$, choose the one with smallest $y'$.

All coordinates are non-negative and at most $10^9$.

Input

The first line contains $n$.

The next $n$ lines describe the requests.

Output

For every find, print x' y'. If no valid point exists, print -1.

Subtasks

• Subtask 1 — 20%: $1\le n\le50$.
• Subtask 2 — 30%: $1\le n\le5000$.
• Subtask 3 — 50%: $1\le n\le2\cdot10^5$.

Examples

Input

7
add 1 1
add 3 4
find 0 0
remove 1 1
find 0 0
add 1 1
find 0 0

Output

1 1
3 4
1 1

Explanation

The sample is processed in order; every printed item/line corresponds to an operation that requires output.