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.*;
import java.math.*;
import java.text.*;
public class Main
{ 
public static void main(String[] args)throws java.io.IOException
{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out=new PrintWriter(System.out);

int lim,len,q,i,i1,x,pos,val,offset;
char ch;
StringBuffer strbuffer,resBuffer;
String str,resstr;
boolean left_exists,right_exists;


lim=31;
Hashtable<Integer,Integer> table=new Hashtable<Integer,Integer>();

q=Integer.parseInt(in.readLine().trim());

for(i1=0;i1<=q;i1++)
{
	if(i1==0)
	{
	ch='+';
	x=0;
	}
	else
	{
	StringTokenizer st=new StringTokenizer(in.readLine().trim());

	ch=st.nextToken().charAt(0);
	x=Integer.parseInt(st.nextToken());
	}

	str=Integer.toBinaryString(x);
	len=str.length();

	strbuffer=new StringBuffer("");

	for(i=0;i<(lim-len);i++)
		strbuffer.append(0);

	for(i=0;i<len;i++)
		strbuffer.append(str.charAt(i));



	if(ch=='+')
	{
		pos=0;
		table.put(pos,1);

		for(i=1;i<lim;i++)
		{
			offset=(int)strbuffer.charAt(i)-47;
			pos=2*pos+offset;

			if(!table.containsKey(pos))
			{
				table.put(pos,1);
			}
			else
			{
				val=table.get(pos);
				table.put(pos,val+1);
			}
		}
	}
	else if(ch=='-')
	{

		pos=0;
		val=table.get(pos);
		table.put(pos,val-1);

		for(i=1;i<lim;i++)
		{
			offset=(int)strbuffer.charAt(i)-47;
			pos=2*pos+offset;


			val=table.get(pos);
			table.put(pos,val-1);
		}

	}
	else
	{
		pos=0;
		resBuffer=new StringBuffer("0");

		for(i=1;i<lim;i++)
		{
			left_exists=false;
			right_exists=false;

			if(table.containsKey(2*pos+1))
			{
				if(table.get(2*pos+1)>0)
				{
					left_exists=true;
				}
			}

			if(table.containsKey(2*pos+2))
			{
				if(table.get(2*pos+2)>0)
				{
					right_exists=true;
				}
			}



			if(left_exists && right_exists)
			{
				if(strbuffer.charAt(i)=='0')
				{
					pos=2*pos+2;
					resBuffer.append(1);
				}
				else
				{
					pos=2*pos+1;
					resBuffer.append(1);
				}
			}
			else if(left_exists)
			{
				pos=2*pos+1;
				
				if(strbuffer.charAt(i)=='0')
				{
					resBuffer.append(0);
				}
				else
				{
					resBuffer.append(1);
				}

			}
			else
			{
				pos=2*pos+2;

				if(strbuffer.charAt(i)=='0')
				{
					resBuffer.append(1);
				}
				else
				{
					resBuffer.append(0);
				}
			}

		}


		resstr=resBuffer.toString();
		out.println(Integer.parseInt(resstr,2));
	}

}



out.flush();
out.close();

}

}  