Questions Keep Coming

Ningning likes questions that can be answered with yes or no. The answer to Ningning's first question was "Yes".

From the second question on, Ningning keeps asking questions of the following forms:

• 1 x y: Were the answers to all questions from the $x$-th to the $y$-th all "Yes"?
• 2 x y: Were the answers to all questions from the $x$-th to the $y$-th all "No"?

When Ningning asks one of these questions, you have already answered questions $x$ through $y$. Write a program that answers every question Ningning asks.

The first line contains $N$, the number of questions after the first one. In other words, Ningning asks $N+1$ questions in total.

Each of the next $N$ lines contains one question in the form 1 x y or 2 x y.

Print $N$ lines, the answers to Ningning's questions in order. Print Yes if the answer is "Yes" and No if the answer is "No".

All given numbers are integers.

• $1 \le N \le 200\,000$
• For the $i$-th question ($2 \le i \le N+1$), $1 \le x \le y < i$.