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>.
ii=lambda:int(input())
kk=lambda:map(int, input().split())
ll=lambda:list(kk())

class Node:
	"""docstring for Node"""
	def __init__(self, parent, edge):
		self.children = [None, None]
		self.count = 0
		self.parent = parent
		self.fin = False
		self.edge= edge

	def next(self, pref):
		return (pref, self.children[pref]) if self.children[pref] else (pref^1, self.children[pref^1])
	def add(self, di):
		if not self.children[di]:
			self.children[di] = Node(self, di)
		return self.children[di]

	def end(self):
		self.count+=1
		self.fin=True

	def remC(self, i):
		self.children[i]=None
		if self.children[i^1] is None:
			self.parent.remC(self.edge)
			del self

	def remV(self):
		self.count-=1
		if self.count==0:
			self.parent.remC(self.edge)
			del self

def make(ite, node):
	for v in ite: node = node.add(v)
	node.end()
def remove(ite, node):
	for v in ite: node = node.children[v]
	node.remV()
def traverse(ite, node):
	res = 0
	for v in ite:
		i,node= node.next(v^1)
		res = 2*res + (i^v)
	return res

root = Node(None, -1)
make((0 for _ in range(31)), root)
for _ in range(ii()):
	s,i=input().split()
	i = int(i)
	ite = (min(1, (2**x)&i) for x in range(30, -1, -1))	
	if s == '+': make(ite, root)
	elif s == '-': remove(ite, root)
	else: print(traverse(ite,root))