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>.
from sys import stdin, stdout
def main():
    rl = stdin.readline
    q = int(rl())
    a = [0] * 6000010
    to = [None] * 12000010
    ans = []
    for i in xrange(0, 60, 2):
        to[i] = i + 2
        a[i+2] += 1
    c = 64
    push = ans.append
    for _ in xrange(q):
        line = rl().split()
        x = bin(int(line[1]))[2:].zfill(30)
        if line[0] == '+':
            j = 0
            for i in map('1'.__eq__, x):
                if to[j+i] is None:
                    to[j+i] = c
                    c += 2
                j = to[j+i]
                a[j] += 1
        elif line[0] == '-':
            j = 0
            for i in map('1'.__eq__, x):
                j = to[j+i]
                a[j] -= 1
        else:
            j = 0
            tmp = 0
            for i in map('0'.__eq__, x):
                tmp = tmp * 2
                if to[j+i] is None or not a[to[j+i]]:
                    i ^= 1
                else:
                    tmp += 1
                j = to[j+i]
            push(tmp)
    stdout.write('\n'.join(map(str, ans)))
main()
