Problem: 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.

Input

The first line contains one integer number n (1 ≤ n ≤ 105).

Next n lines contain three integer numbers t, l, r (1 ≤ t ≤ 3, 1 ≤ l ≤ r ≤ 1018) — type of the query, left and right bounds.

Output

Print MEX of the set after each query.

Examples

Input

3
1 3 4
3 1 6
2 1 3


Output

1
3
1


Input

4
1 1 3
3 5 6
2 4 4
3 1 6


Output

4
4
4
1

Note

Here are contents of the set after each query in the first example:

  1. {3, 4} — the interval [3, 4] is added 
  2. {1, 2, 5, 6} — numbers {3, 4} from the interval [1, 6] got deleted and all the others are added 
  3. {5, 6} — numbers {1, 2} got deleted 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
void write(long long x) {
  if (x == 0) {
    putchar('0');
    return;
  }
  if (x < 0) x = -x, putchar('-');
  long long num[20], len = 0;
  while (x) {
    num[++len] = x % 10;
    x /= 10;
  }
  while (len) {
    putchar(num[len] + '0');
    len--;
  }
}
long long min(long long x, long long y) { return x < y ? x : y; }
long long max(long long x, long long y) { return x > y ? x : y; }
const long long INF = 1e18;
struct Node {
  long long l, r;
  mutable long long val;
  Node(long long _l, long long _r, long long _val) {
    l = _l, r = _r;
    val = _val;
  }
  Node(long long _l) { l = _l; }
  bool operator<(const Node x) const { return l < x.l; }
};
set<Node> s;
set<Node>::iterator spilt(long long pos) {
  set<Node>::iterator it = s.lower_bound(Node(pos));
  if (it != s.end() && it->l == pos) return it;
  it--;
  long long l = it->l, r = it->r, val = it->val;
  s.erase(it);
  s.insert(Node(l, pos - 1, val));
  return s.insert(Node(pos, r, val)).first;
}
void assign(long long l, long long r, long long val) {
  set<Node>::iterator itr = spilt(r + 1), itl = spilt(l);
  s.erase(itl, itr);
  s.insert(Node(l, r, val));
}
void change(long long l, long long r) {
  set<Node>::iterator itr = spilt(r + 1), itl = spilt(l);
  for (set<Node>::iterator it = itl; it != itr; it++) it->val ^= 1;
}
long long query() {
  for (set<Node>::iterator it = s.begin(); it != s.end(); it++)
    if (it->val == 0) return it->l;
  return -1;
}
signed main() {
  long long m = read();
  s.insert(Node(1, 1e18, 0));
  while (m--) {
    long long op = read(), l = read(), r = read();
    if (op == 1)
      assign(l, r, 1);
    else if (op == 2)
      assign(l, r, 0);
    else if (op == 3)
      change(l, r);
    write(query()), putchar('\n');
  }
  return 0;
}