#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int MAXN = 4e5 + 5;
const int MAXM = 2e6 + 5;
const int MOD = 1e9 + 7;
int sgn(double x) {
  if (fabs(x) < eps) return 0;
  if (x < 0)
    return -1;
  else
    return 1;
}
long long pw(long long a, long long n, long long mod) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ret;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void inc(long long &a, long long b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
void dec(long long &a, long long b) {
  a -= b;
  if (a < 0) a += MOD;
}
int mul(int a, int b) {
  long long c = 1ll * a * b;
  return c - c / MOD * MOD;
}
int fa[MAXN], val[MAXN];
int find(int x) {
  if (x == fa[x]) return x;
  int rt = find(fa[x]);
  val[x] ^= val[fa[x]];
  return fa[x] = rt;
}
void merge(int u, int v, int x) {
  int fu = find(u), fv = find(v);
  if (fu == fv) return;
  x ^= val[u] ^ val[v];
  fa[fu] = fv;
  val[fu] = x;
}
unordered_map<int, int> hs;
int main() {
  for (int i = 1; i < MAXN; i++) fa[i] = i;
  int q;
  scanf("%d", &q);
  int t, l, r, x, last = 0, sz = 0;
  while (q--) {
    scanf("%d%d%d", &t, &l, &r);
    l ^= last, r ^= last;
    if (l > r) swap(l, r);
    r++;
    if (!hs.count(l)) hs[l] = ++sz;
    l = hs[l];
    if (!hs.count(r)) hs[r] = ++sz;
    r = hs[r];
    if (t == 1) {
      scanf("%d", &x);
      x ^= last;
      merge(l, r, x);
    } else {
      if (find(l) == find(r)) {
        last = val[l] ^ val[r];
        printf("%d\n", last);
      } else {
        puts("-1");
        last = 1;
      }
    }
  }
}
