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.util.*;

public class D {
	
	public static void main(String[] args) {
		
		Scanner qwe = new Scanner(System.in);
		
		int maxshift = 29;
		int q = qwe.nextInt();
		
		node root= new node(0);
		root.update(0, maxshift,1);
		while(q-->0){
			
			char op = qwe.next().charAt(0);
			int num = qwe.nextInt();
			if(op == '+'){
				root.update(num, maxshift,1);
			}
			else if(op == '-'){
				root.update(num, maxshift, -1);
			}
			else{
				System.out.println(root.ask(num, maxshift));
			}
			
			
		}
		
		qwe.close();
	}
	
	static class node{
		node left,right;
		int size;
		public node(int size){
			this.size = size;
		}
		
		public node(){
			size = 1;
		}
		
		public node getleft(){
			if(left != null) return left;
			left = new node(0);
			return left;
		}
		
		public node getright(){
			if(right != null) return right;
			right = new node(0);
			return right;
		}
		
		public void update(int num, int curshift, int d){
			size+=d;
			if(curshift == -1) return;
			if(((1<<curshift) & num) == 0){ 
				getleft().update(num, curshift-1,d);
			}
			else{
				getright().update(num, curshift-1,d);
			}
		}
		
		public int ask(int at, int curshift){
			if(curshift == -1) return 0;
			int ret = 0;
			if(((1<<curshift) & at) == 0){ 
				
				node cright = getright();
				if(cright.size > 0){
					ret = (1 << curshift);
					ret += cright.ask(at, curshift-1);
				}
				else ret = getleft().ask(at, curshift-1);
				
			}
			else{
				
				node cleft = getleft();
				if(cleft.size > 0){
					ret =  (1 << curshift);
					ret += cleft.ask(at, curshift-1);
				}
				else ret = getright().ask(at, curshift-1);
				
			}
			
			return ret;
			
		}
		
	}
	

}
