#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n, p, x, sum[32], tot;
struct tree {
    int m, next[2];
} kk[6200010];
void insert(int num) {
    int u = 0;
    for (int i = 0; i < 32; i++) {
        int c = (num >> i) & 1;
        if (!kk[u].next[c])
            kk[u].next[c] = ++tot;
        kk[u].m++;
        u = kk[u].next[c];
        if (c == 1)
            sum[i]++;
    }
    return;
}
void update(int index, int dep) {
    if (kk[index].next[1])
        update(kk[index].next[1], dep + 1);
    if (kk[index].next[0])
        sum[dep] += kk[kk[index].next[0]].m;
    if (kk[index].next[1])
        sum[dep] += kk[kk[index].next[0]].m;

    swap(kk[index].next[0], kk[index].next[1]);
    return;
}
int que() {
    int ans = 0;
    for (int i = 0; i < 32; i++) ans |= ((sum[i] & 1) << i);
    return ans;
}
int main() {
    //	freopen("in.txt","r",stdin);
    cin >> n;
    for (int k = 1; k <= n; k++) {
        cin >> p;
        if (p == 1)
            update(1, 0);
        else {
            cin >> x;
            insert(x);
        }
        int res = que();
        cout << res << endl;
    }
    return 0;
}