As you might remember from the previous round, Vova is currently playing a strategic game known as Rage of Empires.

Vova managed to build a large army, but forgot about the main person in the army - the commander. So he tries to hire a commander, and he wants to choose the person who will be respected by warriors.

Each warrior is represented by his personality — an integer number pi. Each commander has two characteristics — his personality pj and leadership lj (both are integer numbers). Warrior i respects commander j only if <image> (<image> is the bitwise excluding OR of x and y).

Initially Vova's army is empty. There are three different types of events that can happen with the army:

  * 1 pi — one warrior with personality pi joins Vova's army; 
  * 2 pi — one warrior with personality pi leaves Vova's army; 
  * 3 pi li — Vova tries to hire a commander with personality pi and leadership li. 



For each event of the third type Vova wants to know how many warriors (counting only those who joined the army and haven't left yet) respect the commander he tries to hire.

Input

The first line contains one integer q (1 ≤ q ≤ 100000) — the number of events.

Then q lines follow. Each line describes the event:

  * 1 pi (1 ≤ pi ≤ 108) — one warrior with personality pi joins Vova's army; 
  * 2 pi (1 ≤ pi ≤ 108) — one warrior with personality pi leaves Vova's army (it is guaranteed that there is at least one such warrior in Vova's army by this moment); 
  * 3 pi li (1 ≤ pi, li ≤ 108) — Vova tries to hire a commander with personality pi and leadership li. There is at least one event of this type. 

Output

For each event of the third type print one integer — the number of warriors who respect the commander Vova tries to hire in the event.

Example

Input

5
1 3
1 4
3 6 3
2 4
3 6 3


Output

1
0

Note

In the example the army consists of two warriors with personalities 3 and 4 after first two events. Then Vova tries to hire a commander with personality 6 and leadership 3, and only one warrior respects him (<image>, and 2 < 3, but <image>, and 5 ≥ 3). Then warrior with personality 4 leaves, and when Vova tries to hire that commander again, there are no warriors who respect him.
#include <bits/stdc++.h>
using namespace std;
long long int dp[2][100005];
struct trie {
  trie *a[2];
  long long int val;
  trie() {
    a[0] = NULL;
    a[1] = NULL;
    val = 0;
  }
};
void insert(trie *root, long long int s, long long int sum) {
  trie *temp = root;
  for (long long int i = 31; i >= 0; --i) {
    bool ind = s & (1 << i);
    if (temp->a[ind] == NULL) temp->a[ind] = new trie();
    temp->a[ind]->val += sum;
    temp = temp->a[ind];
  }
}
long long int query(trie *root, long long int p, long long int l) {
  trie *temp = root;
  long long int ans = 0;
  for (long long int i = 31; i >= 0; --i) {
    bool ind = p & (1 << i), req = l & (1 << i);
    if (temp->a[0] == NULL) temp->a[0] = new trie();
    if (temp->a[1] == NULL) temp->a[1] = new trie();
    if (ind && req) {
      ans = ans + temp->a[1]->val;
      temp = temp->a[0];
    }
    if (ind && (!req)) {
      temp = temp->a[1];
    }
    if ((!ind) && req) {
      ans = ans + temp->a[0]->val;
      temp = temp->a[1];
    }
    if ((!ind) && (!req)) {
      temp = temp->a[0];
    }
  }
  return ans;
}
int main() {
  long long int n, i, r = 0;
  cin >> n;
  trie *root = new trie();
  insert(root, 0, 0);
  for (i = 0; i < n; ++i) {
    long long int t, p;
    cin >> t >> p;
    if (t == 1) insert(root, p, 1);
    if (t == 2) insert(root, p, -1);
    if (t == 3) {
      long long int l;
      cin >> l;
      cout << query(root, p, l) << "\n";
    }
  }
  return 0;
}
