Author has gone out of the stories about Vasiliy, so here is just a formal task description.

You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:

  1. "+ x" — add integer x to multiset A.
  2. "- x" — erase one occurrence of integer x from multiset A. It's guaranteed that at least one x is present in the multiset A before this query.
  3. "? x" — you are given integer x and need to compute the value <image>, i.e. the maximum value of bitwise exclusive OR (also know as XOR) of integer x and some integer y from the multiset A.



Multiset is a set, where equal elements are allowed.

Input

The first line of the input contains a single integer q (1 ≤ q ≤ 200 000) — the number of queries Vasiliy has to perform.

Each of the following q lines of the input contains one of three characters '+', '-' or '?' and an integer xi (1 ≤ xi ≤ 109). It's guaranteed that there is at least one query of the third type.

Note, that the integer 0 will always be present in the set A.

Output

For each query of the type '?' print one integer — the maximum value of bitwise exclusive OR (XOR) of integer xi and some integer from the multiset A.

Example

Input

10
+ 8
+ 9
+ 11
+ 6
+ 1
? 3
- 8
? 3
? 8
? 11


Output

11
10
14
13

Note

After first five operations multiset A contains integers 0, 8, 9, 11, 6 and 1.

The answer for the sixth query is integer <image> — maximum among integers <image>, <image>, <image>, <image> and <image>.
#include <bits/stdc++.h>
using namespace std;
struct No {
  map<char, pair<No *, long long> > trans;
  bool word = false;
};
No *head;
No *makeNo() { return new No(); }
char comp(char x) { return (x == '0' ? '1' : '0'); }
string toBin(long long x) {
  string r;
  for (long long i = 32; i >= 0; i--) {
    r += ((bool)(x & (1ll << i)) + '0');
  }
  return r;
}
string toBinQuery(long long x) {
  string r = "";
  for (long long i = 32; i >= 0; i--) {
    if ((bool)(x & (1ll << i)))
      r += '0';
    else
      r += '1';
  }
  return r;
}
long long toInt(string x) {
  long long c = 0;
  for (long long i = 0; i < 33; i++) {
    if (x[i] == '1') c += (1ll << (32 - i));
  }
  return c;
}
void insert(string x) {
  No *aux = head;
  for (char c : x) {
    if (aux->trans[c].first) {
      aux->trans[c].second += 1;
    } else {
      aux->trans[c].first = makeNo();
      aux->trans[c].second = 1;
    }
    aux = aux->trans[c].first;
  }
  aux->word = true;
}
void del(string x) {
  No *aux = head;
  long long i = 0;
  for (char c : x) {
    if ((--(aux->trans[c].second)) == 0) {
      aux->trans[c].first = NULL;
      return;
    }
    aux = aux->trans[c].first;
  }
}
string query(string x) {
  No *aux = head;
  string r = "";
  for (char c : x) {
    if (aux->trans[c].first) {
      r += c;
      aux = aux->trans[c].first;
    } else {
      r += comp(c);
      aux = aux->trans[comp(c)].first;
    }
  }
  return r;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  head = makeNo();
  long long q;
  cin >> q;
  insert(toBin(0));
  while (q--) {
    char aux;
    long long y;
    cin >> aux >> y;
    if (aux == '+') {
      string x = toBin(y);
      insert(x);
    } else if (aux == '-') {
      string x = toBin(y);
      del(x);
    } else {
      string x = toBinQuery(y);
      long long r = toInt(query(x)) ^ y;
      cout << r << endl;
    }
  }
}
