#include <bits/stdc++.h>
#define db double
#define ll long long
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int, int>
#define vp vector<pii>
#define vip vector<vp>
#define mkp make_pair
#define pb push_back
#define Case(x) cout << "Case #" << x << ": "
using namespace std;
const int INF = 0x3f3f3f3f;
const int P = 998244353;
const int N = 1e7 + 10;
const int DEP = 31;
struct Node {
    Node *ch[2];
    int cnt, sz, val, dep;
    Node() {
        ch[0] = ch[1] = nullptr;
        sz = val = dep = 0;
    }
};
void pushup(Node *p) {
    p->val = 0;
    p->sz = p->cnt;
    for (int i = 0; i < 2; i++) {
        Node *ch = p->ch[i];
        if (ch) {
            p->sz += ch->sz;
            p->val ^= ch->val;
            if (ch->sz & 1) {
                p->val ^= i << (p->dep);
            }
        }
    }
}
void insert(Node *&p, int x, int dep) {
    if (!p) {
        p = new Node;
        p->dep = dep;
    }
    if (dep > DEP) {
        p->sz++;
        p->cnt++;
        return;
    }
    insert(p->ch[(x >> dep) & 1], x, dep + 1);
    pushup(p);
}
void add_one(Node *p) {
    if (!p)
        return;
    swap(p->ch[0], p->ch[1]);
    add_one(p->ch[0]);
    pushup(p);
}
signed main() {
#ifdef _DEBUG
    freopen("1.in", "r", stdin);
    FILE *file = freopen("out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int Q;
    cin >> Q;
    Node *rt = new Node;
    while (Q--) {
        int opt, x;
        cin >> opt;
        if (opt == 1) {
            add_one(rt);
        } else {
            cin >> x;
            insert(rt, x, 0);
        }
        cout << rt->val << '\n';
    }
    return 0;
}