#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 422222, maxd = 32;

ll lim[maxd], sum, q, op;
deque<int> in[maxd];

int main() {
    scanf("%lld", &q);
    for (int i = 0; i < maxd; ++i) {
        ll sz = min(1LL << i, 400000LL);
        lim[i] = (1LL << i) - sz;
        in[i].resize(sz);
    }
    while (q--) {
        scanf("%lld", &op);
        if (op == 1) {
            for (int i = 0; i < maxd; ++i) {
                sum ^= in[i].front() << i;
                if (!lim[i])
                    in[i].push_back(in[i].front());
                in[i].pop_front();
            }
        } else {
            ll x;
            scanf("%lld", &x);
            sum ^= x;
            for (ll i = maxd, ful = (1LL << maxd) - 1; i >= 0; --i, ful >>= 1) {
                x &= ful;
                ll dif = ful - x;
                if (dif < (ll)in[i].size())
                    in[i][dif] ^= 1;
            }
        }
        printf("%lld\n", sum);
    }

    return 0;
}