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 ProD {
	static int q,ans,x,op,sz,a;
//	static int[] mm=new int[200005];
//	static Map<Integer,Integer> mp=new HashMap<Integer,Integer>();
	static int[][] ch=new int[6000005][2];
	static int[] val=new int[6000005];
	static void insert(int x)
	{
		int u=0,a;
		for(int i=29;i>=0;i--)
		{
			a=((x&(1<<i))>0)?1:0;
			if(ch[u][a]==0)
			{
				ch[u][a]=++sz;
				ch[sz][0]=ch[sz][1]=0;
			}
			u=ch[u][a];
			val[u]++;
		}
	}
	static int find(int x)
	{
		int u=0,a,res=0;
		for(int i=29;i>=0;i--)
		{
			a=((x&(1<<i))>0)?0:1;
			if(val[ch[u][a]]>0)
			{
				res+=(1<<i)*a;
				u=ch[u][a];
			}
			else
			{
				res+=(1<<i)*(1-a);
				u=ch[u][1-a];
			}
		}
		return res;
	}
	static void delete(int x)
	{
		int u=0,a;
		for(int i=29;i>=0;i--)
		{
			a=((x&(1<<i))>0)?1:0;
			u=ch[u][a];
			val[u]--;
		}
	}

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		q=in.nextInt();
		insert(0);
		while(q-->0)
		{
			op=in.next().charAt(0);
			x=in.nextInt();
			if(op=='+') insert(x);
			else if(op=='-') delete(x);
			else
			{
				ans=find(x)^x;
				System.out.println(ans);
			}
		}
	}
}
