#include <iostream>

using namespace std;

struct Node {
    int s[2];
    int n;
} node[6400000];
int ptr = 1, sum[32];

void insert(int x) {
    for (int i = 0, idx = 0, k; i < 32; i++, idx = node[idx].s[k]) {
        k = (x >> i) & 1;
        if (!node[idx].s[k])
            node[idx].s[k] = ptr++;
        node[idx].n++, sum[i] += k;
    }
}

void inc(int idx, int dep) {
    if (node[idx].s[1])
        inc(node[idx].s[1], dep + 1);
    if (node[idx].s[0])
        sum[dep] += node[node[idx].s[0]].n;
    if (node[idx].s[1])
        sum[dep] -= node[node[idx].s[1]].n;
    swap(node[idx].s[0], node[idx].s[1]);
}

int getv() {
    int ret = 0;
    for (int i = 0; i < 32; i++) {
        ret |= (sum[i] & 1) << i;
    }
    return ret;
}

int main() {
    int n;
    cin >> n;
    for (int _ = 0; _ < n; _++) {
        int op, x;
        cin >> op;
        if (op == 1) {
            inc(0, 0);
        } else {
            cin >> x;
            insert(x);
        }
        cout << getv() << endl;
    }
}