Rectangle Painting

There is an cell grid infinite in left, right, and upwards directions (all the cells with coordinates $(x, y)$ with $x \in \mathbb{Z}$, $y \ge 0$ exist). Initially all the 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})$ for $l\_{i} \le x \le r\_{i}$ black. If the cell is already black, its color doesn't change.
2. $l\_{i}$ $r\_{i}$: consider all cells with $x$ coordinate on the segment $\[l\_{i}; r\_{i}]$. Find the highest cell such that all cells exactly under it are black. Formally, you have to find maximal $h$ such that $\exists \\: x \in \[l\_{i}; r\_{i}] \\: \forall \\: y \in \[0;h)$ cell $(x, y)$ is black.

To enforce processing the queries online they are encrypted using previous answers.

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

The next $q$ lines will contain encrypted descriptions of queries. Let $S$ be the sum of answers to all queries of second type processed so far.

Each description has form either $1$ $(y\_{i} \oplus S)$ $(l\_{i} \oplus S)$ $(r\_{i} \oplus S)$ or $2$ $(l\_{i} \oplus S)$ $(r\_{i} \oplus S)$. It is guaranteed that $0 \le y\_{i} \le 2 \cdot 10^{5}$, $0 \le l\_{i} \le r\_{i} \le 2 \cdot 10^{5}$. Note that the guarantees are given on parameters after decryption, the numbers in input might not fit in 32-bit integers.

Don't forget to add the new answer to $S$ after each query of the second type.

Print the answers to all queries of the second type on separate lines.