#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(__CYGWIN__) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define ssz(x) (signed((x).size()))
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + (c - '0'); c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr int MAXN = 2e5 + 5, MV = 2e5 + 1;
int id, q;

struct Node {
  int l, r, maxv;
  set<int> tag;
  Node() : l(0), r(0), maxv(0), tag() {}
  void check(string _msg) const {
    cerr << _msg, assert(tag.empty() || maxv <= *tag.begin());
  }
} T[MAXN << 2];
#define lc(p) ((p) << 1)
#define rc(p) ((p) << 1 | 1)

set<pii> ODT[MAXN];

void pu(int p) {
  T[p].maxv = 1e9 + 5;
  if (T[p].l != T[p].r)
    T[p].maxv = max(T[lc(p)].maxv, T[rc(p)].maxv);
  if (!T[p].tag.empty())
    cmin(T[p].maxv, *T[p].tag.begin());
}
void build(int p, int l, int r) {
  T[p].l = l, T[p].r = r;
  if (l == r)
    return pu(p);
  int mid = (l + r) >> 1;
  build(lc(p), l, mid), build(rc(p), mid + 1, r), pu(p);
  T[p].check("");
}
void del(int p, int ql, int qr, int v) {
  int l = T[p].l, r = T[p].r;
  // cerr << l << ' ' << r << ' ' << ql << ' ' << qr << ' ' << v << '\n';
  // cerr << T[p].maxv << ' ' << (T[p].tag.empty() ? 1e9 + 5 :
  // *T[p].tag.begin())
  //      << '\n';
  // T[p].check("D\n");
  if (ql <= l && qr >= r)
    return T[p].tag.erase(v), pu(p);
  if (T[p].tag.count(v))
    T[p].tag.erase(v), T[lc(p)].tag.emplace(v), pu(lc(p)),
        T[rc(p)].tag.emplace(v), pu(rc(p));
  int mid = (l + r) >> 1;
  if (ql <= mid)
    del(lc(p), ql, qr, v);
  if (qr > mid)
    del(rc(p), ql, qr, v);
  pu(p);
}
int qry(int p, int ql, int qr) {
  int l = T[p].l, r = T[p].r;
  // T[p].check("Q");
  if (ql <= l && qr >= r)
    return T[p].maxv;
  int mid = (l + r) >> 1;
  int ans = 0;
  if (ql <= mid)
    cmax(ans, qry(lc(p), ql, qr));
  if (qr > mid)
    cmax(ans, qry(rc(p), ql, qr));
  if (!T[p].tag.empty())
    cmin(ans, *T[p].tag.begin());
  return ans;
}
auto split(set<pii> &x, int pos) {
  auto it = x.lower_bound({pos, 0});
  if (it == x.begin())
    return it;
  auto pre = prev(it);
  auto [l, r] = *pre;
  x.erase(pre);
  if (l < pos)
    x.emplace(l, min(r, pos - 1));
  if (r >= pos)
    it = x.emplace(pos, r).fi;
  return it;
}

void Main() {
  // FileIO("iii");
  id = 1, read(q);
  For(i, 0, MV) ODT[i].emplace(0, MV);
  For(i, 0, MV) T[1].tag.emplace(i);
  build(1, 0, MV);
  ll S = 0;
  while (q--) {
    ll op, x, y, z;
    read(op, x, y);
    if (op == 1) {
      read(z);
      x ^= id * S, y ^= id * S, z ^= id * S;
      auto R = split(ODT[x], z + 1), L = split(ODT[x], y);
      for (auto i = L; i != R; i = ODT[x].erase(i)) {
        // cerr << "D " << i->fi << ' ' << i->se << ' ' << x << '\n';
        del(1, i->fi, i->se, x);
      }
    } else {
      x ^= id * S, y ^= id * S;
      int ans = qry(1, x, y);
      printf("%d\n", ans), S += ans;
    }
  }
}
} // namespace

signed main() { return Main(), 0; }