#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n, i, ty, x, ans = 0, tr[2][6000005], pw[30], u, sum[6000005], cnt = 0;
void opt(int p, int q) {
    swap(tr[0][p], tr[1][p]);
    if (tr[1][p] != -1 && sum[tr[1][p]])
        ans ^= pw[q];
    if (tr[0][p] != -1 && sum[tr[0][p]])
        ans ^= pw[q];
    if (tr[0][p] != -1)
        opt(tr[0][p], q + 1);
}
void ins(int x) {
    int i, u = 0;
    ans ^= x;
    sum[u] ^= 1;
    for (i = 0; i < 30; i++) {
        if (x & pw[i]) {
            if (tr[1][u] == -1)
                tr[1][u] = ++cnt;
            u = tr[1][u];
            sum[u] ^= 1;
        } else {
            if (tr[0][u] == -1)
                tr[0][u] = ++cnt;
            u = tr[0][u];
            sum[u] ^= 1;
        }
    }
}
int main() {
    memset(tr, -1, sizeof(tr));
    scanf("%d", &n);
    pw[0] = 1;
    for (i = 1; i < 30; i++) pw[i] = pw[i - 1] * 2;
    for (i = 1; i <= n; i++) {
        scanf("%d", &ty);
        if (ty == 1) {
            opt(0, 0);
            printf("%d\n", ans);
        } else {
            scanf("%d", &x);
            ins(x);
            printf("%d\n", ans);
        }
    }
    return 0;
}