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 java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class D {

	

	static class Node {
		int freq;
		int num;
		Node left;
		Node right;
		
		Node (int f){
			freq = f;
		}
	}
	
	static class Tree {
		Node root;
		Tree (){
			root = new Node (0);
		}
		
		static ArrayList<Integer> inBinary (int num){
			ArrayList<Integer> res = new ArrayList<>();
			while (num > 0) {
				res.add(0 , num % 2);
				num /= 2;
			}
			return res;
		}
		
		void insert (int num) {
			ArrayList<Integer> inBinary = inBinary(num);
			insertHelper (root , inBinary , num , 0);
		}
		
		void insertHelper (Node current , ArrayList<Integer> inBinary , int num , int idx) {
			if (idx == 33) {
				current.num = num;
				return;
			}
			if (inBinary.size() >= 33 - idx) {
				if (inBinary.get(inBinary.size() - (33 - idx)) == 0) {
					if (current.left == null) {
						current.left = new Node (1);
						insertHelper(current.left , inBinary , num , idx + 1);
					}
					else {
						current.left.freq ++ ;
						insertHelper(current.left , inBinary , num , idx + 1);
					}
				}
				else {
					if (current.right == null) {
						current.right = new Node (1);
						insertHelper(current.right , inBinary , num , idx + 1);
					}
					else {
						current.right.freq ++ ;
						insertHelper(current.right , inBinary , num , idx + 1);
					}
				}
			}
			else {
				if (current.left != null) {
					current.left.freq ++ ;
				}
				else {
					current.left = new Node (1);
				}
				
				insertHelper(current.left, inBinary, num, idx + 1);
			}
		}
		
		int getMax (int num) {
			ArrayList<Integer> inBinary = inBinary(num);
			return num ^ getMaxHelper(root, inBinary, 0);
		}	
		
		int  getMaxHelper (Node current , ArrayList<Integer> inBinary , int idx) {
			if (idx == 33) return current.num ;
			if (inBinary.size() >= 33 - idx) {
				if (inBinary.get(inBinary.size() - (33 - idx)) == 0) {
					if (current.right == null || current.right.freq == 0) {
						return getMaxHelper(current.left , inBinary , idx + 1);
					}
					else {

						return getMaxHelper(current.right , inBinary , idx + 1);
					}
				}
				else {
					if (current.left == null || current.left.freq == 0) {
						return getMaxHelper(current.right , inBinary , idx + 1);
					}
					else {
						return getMaxHelper(current.left , inBinary , idx + 1);
					}
				}
			}
			else {
				if (current.right == null || current.right.freq == 0) {

					return getMaxHelper(current.left , inBinary , idx + 1);
				}
				else {

					return getMaxHelper(current.right , inBinary , idx + 1);
				}
			}
		}
		
		void remove (int num) {
			ArrayList<Integer> inBinary = inBinary(num);
			removeHelper (root , inBinary , 0);
		}
		
		void removeHelper (Node current , ArrayList<Integer> inBinary , int idx) {
			if (idx == 33) {
				return ;
			}
			if (inBinary.size() >= 33 - idx) {
				if (inBinary.get(inBinary.size() - (33 - idx)) == 0) {
					if (current.left == null || current.left.freq == 0) {
						current.left = new Node (0);
						removeHelper(current.left , inBinary , idx + 1);
					}
					else {
						current.left.freq -- ;
						removeHelper(current.left , inBinary , idx + 1);
					}
				}
				else {
					if (current.right == null || current.right.freq == 0) {
						current.right = new Node (0);
						removeHelper(current.right , inBinary , idx + 1);
					}
					else {
						current.right.freq -- ;
						removeHelper(current.right , inBinary , idx + 1);
					}
				}
			}
			else {
				removeHelper(current.left, inBinary, idx + 1);
			}
		}
	}
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		PrintWriter out = new PrintWriter(System.out);
		Tree tree = new Tree();
		tree.insert(0);
		int q = sc.nextInt();
		while (q -- > 0) {
			char type = sc.next().charAt(0);
			if (type == '+')
				tree.insert(sc.nextInt());
			else if (type == '-')
				tree.remove(sc.nextInt());
			else System.out.println(tree.getMax(sc.nextInt()));
		}
		out.flush();
		out.close();
	}

	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}
}
