CF319E.Ping-Pong

In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a path from interval _I_1 from our set to interval _I_2 from our set if there is a sequence of successive moves starting from _I_1 so that we can reach _I_2.

Your program should handle the queries of the following two types:

1. "1 x y" (x < y) — add the new interval (x, y) to the set of intervals. The length of the new interval is guaranteed to be strictly greater than all the previous intervals.
2. "2 a b" (a ≠ b) — answer the question: is there a path from a-th (one-based) added interval to b-th (one-based) added interval?

Answer all the queries. Note, that initially you have an empty set of intervals.

本题中，在任意时刻你都拥有一组区间。当且仅当满足 $c < a < d$ 或 $c < b < d$ 时，你才能从当前集合中的区间 $(a,\,b)$ 移动到当前集合中的另一区间 $(c,\,d)$。此外，若存在一连串连续的移动，使得我们能从集合中的第 $I_1$ 个区间出发最终到达集合中的第 $I_2$ 个区间，则称集合中第 $I_1$ 个区间到第 $I_2$ 个区间之间存在一条路径。

你的程序需处理以下两类查询：

1. 1 x y（其中 $x < y$）—— 将新区间 $(x,\,y)$ 加入区间集合。保证新区间的长度严格大于所有之前加入的区间的长度。
2. 2 a b（其中 $a \neq b$）—— 回答问题：是否存在从第 $a$ 个（下标从 1 开始计数）加入的区间到第 $b$ 个（下标从 1 开始计数）加入的区间的路径？

请回答所有查询。注意，初始时区间集合为空。

The first line of the input contains integer n denoting the number of queries, (1 ≤ n ≤ 105). Each of the following lines contains a query as described above. All numbers in the input are integers and don't exceed 109 by their absolute value.

It's guaranteed that all queries are correct.

输入的第一行包含一个整数 $n$，表示查询的数量（$1 ≤ n ≤ 10^5$）。接下来的每一行包含一个如上所述的查询。输入中的所有数字均为整数，且其绝对值不超过 $10^9$。

保证所有查询均合法。

For each query of the second type print "YES" or "NO" on a separate line depending on the answer.

对于每个第二类查询，根据答案在单独一行输出“YES”或“NO”。