A11016 | MEX Queries

You are given a set of integer numbers, initially it is empty. You should perform $n$ queries.

There are three different types of queries:

- 1 $l$ $r$ — Add all missing numbers from the interval $[l,r]$
- 2 $l$ $r$ — Remove all present numbers from the interval $[l,r]$
- 3 $l$ $r$ — Invert the interval $[l,r]$ — add all missing and remove all present numbers from the interval $[l,r]$

After each query you should output MEX of the set — the smallest positive (MEX $>=1$ ) integer number which is not presented in the set.

The first line contains one integer number $n$ ( $1<=n<=10^{5}$ ).

Next $n$ lines contain three integer numbers $t,l,r$ ( $1<=t<=3,1<=l<=r<=10^{18}$ ) — type of the query, left and right bounds.

Print MEX of the set after each query.