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.*;
import java.util.*;
public final class round_367_d
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static int maxn=30;
	static TrieNode root=new TrieNode();
	
	static void insert(long num)
	{
		TrieNode curr_node=root;
		for(long i=30;i>=0;i--)
		{
			long curr=(1L<<i);
			int curr1=((num&(curr))==0?0:1);
			TrieNode child=curr_node.children[curr1];
			if(child==null)
			{
				child=curr_node.children[curr1]=new TrieNode();
			}
			child.ctr++;
			curr_node=child;
		}
	}
	
	static long get(long x)
	{
		TrieNode curr_node=root;long ans=0;
		for(long i=30;i>=0;i--)
		{
			long curr=(1L<<i);int curr1=1-((x&curr)==0?0:1);
			TrieNode child=curr_node.children[curr1];
			if(child==null || child.ctr<=0)
			{
				curr_node=curr_node.children[1-curr1];
			}
			else
			{
				ans=ans+curr;
				curr_node=curr_node.children[curr1];
			}
		}
		return ans;
	}
	
	static void remove(long x)
	{
		TrieNode curr_node=root;
		for(long i=30;i>=0;i--)
		{
			long curr=(1L<<i);int curr1=(x&curr)==0?0:1;
			TrieNode child=curr_node.children[curr1];
			child.ctr--;
			curr_node=child;
		}
	}
	
	public static void main(String args[]) throws Exception
	{
		insert(0);int n=sc.nextInt();
		for(int i=0;i<n;i++)
		{
			char op=sc.next().charAt(0);long val=sc.nextLong();
			if(op=='+')
			{
				insert(val);
			}
			else if(op=='-')
			{
				remove(val);
			}
			else
			{
				long res=get(val);out.println(res);
			}
		}
		out.close();
	}
}
class TrieNode
{
	TrieNode[] children=new TrieNode[2];int ctr=0;
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}