Rectangle Painting

There is an infinite grid that extends to the left, to the right, and upward. Every cell $(x, y)$ with $x \in \mathbb{Z}$ and $y \ge 0$ exists. Initially all cells are white. You have to process $q$ queries of two types:

1. $y_i$ $l_i$ $r_i$: paint all cells $(x, y_i)$ with $l_i \le x \le r_i$ black. A cell that is already black keeps its color.
2. $l_i$ $r_i$: consider all cells whose $x$ coordinate lies in $[l_i; r_i]$. Find the highest cell such that all cells exactly under it are black. Formally, find the maximal $h$ such that there exists $x \in [l_i; r_i]$ where, for all $y \in [0;h)$, the cell $(x, y)$ is black.

Queries are encrypted with the answers to earlier queries, so they must be processed online.

The first line contains one integer $q$ ($1 \le q \le 10^{5}$), the number of queries.

Each of the next $q$ lines contains an encrypted query. Let $S$ be the sum of the answers to all queries of the second type processed so far. Each query has one of the forms $1$ $(y_i \oplus S)$ $(l_i \oplus S)$ $(r_i \oplus S)$ or $2$ $(l_i \oplus S)$ $(r_i \oplus S)$. The decrypted values satisfy $0 \le y_i \le 2 \cdot 10^{5}$ and $0 \le l_i \le r_i \le 2 \cdot 10^{5}$. The input values may not fit in 32-bit integers.

Add each new answer to $S$ after processing a query of the second type.

For each query of the second type, print the answer on a separate line.