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 sys
input = sys.stdin.readline
from collections import defaultdict


class Trie:
    def __init__(self):
        self.cnt = 0
        self.next = [None] * 2

trie = Trie()

def add(x):
    mask = 1<<32
    cur = trie
    while mask:
        if mask & x:
            if not cur.next[1]:
                cur.next[1] = Trie()
            cur = cur.next[1]
        else:
            if not cur.next[0]:
                cur.next[0] = Trie()
            cur = cur.next[0]
        cur.cnt += 1
        mask >>= 1

def remove(x):
    mask = 1<<32
    cur = trie
    while mask:
        if mask & x:
            cur = cur.next[1]
        else:
            cur = cur.next[0]
        cur.cnt -= 1
        mask >>= 1

def query(x):
    mask = 1<<32
    cur = trie
    ret = 0
    while mask:
        if mask & x:
            if cur.next[0] and cur.next[0].cnt > 0:
                cur = cur.next[0]
                ret += mask
            else:
                cur = cur.next[1]
        else:
            if cur.next[1] and cur.next[1].cnt > 0:
                cur = cur.next[1]
                ret += mask
            else:
                cur = cur.next[0]
        mask >>= 1
    return ret

add(0)
q = int(input())
for _ in range(q):
    comm, x = input().split()
    x = int(x)
    if comm == '+':
        add(x)
    elif comm == '-':
        remove(x)
    else:
        print(query(x))