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.*;
import java.io.*;

public class D {
	static Node root = new Node();

	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		int q = sc.nextInt();
		StringBuilder sb = new StringBuilder();
		
		Node a = root;
		for(int i=1<<30;i>=1;i>>=1){
			a.left();
			a = a.next[0];
			a.cnt++;
		}
		
		while(q-->0){
			String op = sc.next();
			int x = sc.nextInt();
			if(op.equals("+")){
				Node r = root;
				for(int i=1<<30;i>=1;i>>=1){
					if((x&i)==0){
						r.left();
						r = r.next[0];
						r.cnt++;
					}
					else{
						r.right();
						r = r.next[1];
						r.cnt++;
					}
				}
			}
			else if(op.equals("-")){
				Node r = root;
				for(int i=1<<30;i>=1;i>>=1){
					if((x&i)==0){
						r = r.next[0];
						r.cnt--;
					}
					else{
						r = r.next[1];
						r.cnt--;
					}
				}
			}
			else{
				int ans = 0;
				Node r = root;
				for(int i=1<<30;i>=1;i>>=1){
					if((x&i)==0){
						if(r.next[1]==null ||r.next[1].cnt==0){
							r = r.next[0];
						}
						else{
							r = r.next[1];
							ans|=i;
						}
					}
					else{
						if(r.next[0]==null ||r.next[0].cnt==0){
							r = r.next[1];
						}
						else{
							r = r.next[0];
							ans|=i;
						}
					}
				}
				sb.append(ans+"\n");
			}
		}
		System.out.print(sb);
	}
}
class Node{
	Node[] next = new Node[2];
	int cnt=0;
	void left(){
		if(next[0] == null)	next[0] = new Node();
	}
	void right(){
		if(next[1] == null)	next[1] = new Node();
	}
}