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>.
import collections

max_bits = 30

#root = collections.Counter()
#vals = collections.defaultdict(int)

class BNode:
    def __init__(self, ct=0, zero=None, one=None):
        self.ct = ct
        self.zero = None
        self.one = None
    def __str__(self):
        return ' '.join([str(self.ct), str(self.zero), str(self.one)])

root = BNode()

def bits(x):
    bit = 2**(max_bits-1)
    for i in range(max_bits):
        if x & bit:
            yield 1
        else:
            yield 0
        bit >>= 1


def add(x, root):
    root.ct += 1
    for b in bits(x):
        if b:
            if not root.one:
                root.one = BNode()
            root = root.one
        else:
            if not root.zero:
                root.zero = BNode()
            root = root.zero
        root.ct += 1


def sub(x, root):
    root.ct -= 1
    for b in bits(x):
        if b:
            if root.one.ct == 1:
                root.one = None
                break
            root = root.one
        else:
            if root.zero.ct == 1:
                root.zero = None
                break
            root = root.zero
        root.ct -= 1

def question(x, root):
    y = 0
    for b in bits(x):
        if b:
            if root.zero and root.zero.ct > 0:
                root = root.zero
                y = y*2
            else:
                root = root.one
                y = y*2 + 1
        else:
            if root.one and root.one.ct > 0:
                root = root.one
                y = y*2 + 1
            else:
                root = root.zero
                y = y*2
    return x ^ y

add(0,root)

q = int(input())

output = []

for i in range(q):
    qtype, x = input().split()
    x = int(x)
    if qtype == '+':
        add(x, root)
    if qtype == '-':
        sub(x, root)
    if qtype == '?':
        output.append(str(question(x,root)))

print("\n".join(output))