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>.
#Bhargey Mehta (Sophomore)
#DA-IICT, Gandhinagar
import sys, math, queue
#sys.stdin = open("input.txt", "r")
MOD = 10**9+7


def getBin(x):
    num = [-1 for i in range(32)]
    for i in range(1, 33):
        num[-i] = x&1
        x = x>>1
    return num

t = [-1, -1]

def add(x, trie, i):
    if i == len(x): return
    if trie[x[i]] == -1:
        trie[x[i]] = [-1, -1]
    add(x, trie[x[i]], i+1)

def query(x, trie, i, ans):
    if i == len(x): return ans
    
    if x[i] == 1:
        if trie[0] == -1:
            return query(x, trie[1], i+1, ans<<1)
        else:
            return query(x, trie[0], i+1, (ans<<1)+1)
    else:
        if trie[1] == -1:
            return query(x, trie[0], i+1, ans<<1)
        else:
            return query(x, trie[1], i+1, (ans<<1)+1)

def delete(x, trie, i):
    if i == len(x): return
    delete(x, trie[x[i]], i+1)
    if trie[x[i]] == [-1, -1]:
        trie[x[i]] = -1


n = int(input())
add(getBin(0), t, 0)
f = {0: 1}

for _ in range(n):
    q, x = input().split()
    x = int(x)
    if q == '+':
        if x in f: f[x] += 1
        else:
            f[x] = 1
            add(getBin(x), t, 0)
    elif q == '?':
        print(query(getBin(x), t, 0, 0))
    else:
        if f[x] == 1:
            del f[x]
            delete(getBin(x), t, 0)
        else: f[x] -= 1

