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







public class q2 {
	
		public static void main(String[] args) throws Exception
		{
			InputReader in=new InputReader(System.in);
			PrintWriter pw=new PrintWriter(System.out);
			int n=in.nextInt();
			HashMap<Long,Integer> hm=new HashMap<Long,Integer>();
			hm.put(0L, 0);
			trie t=new trie();
			t.insert(0);
			for(int i=0;i<n;i++)
			{
				StringTokenizer st=new StringTokenizer(in.readString());
				String s1=st.nextToken();
				long w=Long.parseLong(in.readString());
				if(s1.charAt(0)=='+')
				{
					if(hm.containsKey(w))
					{
						int cc=hm.get(w);
						hm.put(w, cc+1);
					}
					else
					{
						hm.put(w, 1);
						t.insert(w);
					}
				}
				else if(s1.charAt(0)=='-')
				{
					int cc=hm.get(w);
					if(cc==1)
					{
						hm.remove(w);
						t.remove(w);
					}
					else
					{
						hm.put(w, cc-1);
					}
				}
				else
				{
					long ans=t.findmax(w);
					pw.println(ans);
				}
					
			}
			pw.close();
			
			
			
			
		
		}
		static class trienode
		{
			trienode[] arr;
			int occurence;
			public trienode()
			{
				arr=new trienode[2];
				occurence=0;
			}
		}
		static class trie
		{
			trienode root;
			public trie()
			{
				root =new trienode();
			}
			public void insert(long w)
			{
				trienode cur=root;
				for(int i=31;i>=0;i--)
				{
					int bit=0;
					if(((1<<i)&w)>0)
					{
						bit=1;
					}
					if(cur.arr[bit]==null)
					{
						cur.arr[bit]=new trienode();
					}
					cur=cur.arr[bit];
					cur.occurence++;
					
				}
			}
			public void remove(long w)
			{
			trienode cur=root;
			for(int i=31;i>=0;i--)
			{
				int bit=0;
				if(((1<<i)&w)>0)
				{
					bit=1;
				}
				if(cur.arr[bit].occurence==1)
				{
					cur.arr[bit]=null;
					return;
				}
				cur=cur.arr[bit];
				cur.occurence--;
			}
			}
			public  long findmax(long w)
			{
				trienode cur=root;
				long ans=0;
				for(int i=31;i>=0;i--)
				{
					int bit=0;
					if(((1<<i)&w)>0)
					{
						bit=1;
					}
					if(cur.arr[1-bit]!=null)
					{
						cur=cur.arr[1-bit];
						ans+=(1<<i);
					}
					else
					{
						cur=cur.arr[bit];
					}
					
				}
				return ans;
			}
		}
		
	
	
		
		
	static class InputReader {

		private InputStream stream;
		private byte[] buf = new byte[8192];
		private int curChar;
		private int snumChars;
		private SpaceCharFilter filter;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public int nextInt() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}

			int res = 0;

			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));

			return res * sgn;
		}
		
		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}

			long res = 0;

			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));

			return res * sgn;
		}
		
		public String readString() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
}