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.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;

public class D {
	static int maxBits = 30;

	static class Trei {
		Trei zeros, ones;
		int countZeros, countOnes;

		Trei() {
			countZeros = 0;
			countOnes = 0;
		}

		void insertOnes(int bit) {
			if (countOnes == 0) {
				ones = new Trei();
			}
			countOnes++;
		}

		void removeOnes(int bit) {
			countOnes--;
		}

		void insertZeros(int bit) {
			if (countZeros == 0) {
				zeros = new Trei();
			}
			countZeros++;
		}

		void removeZeros(int bit) {
			countZeros--;
		}

		boolean containsOne(int bit) {
			return countOnes > 0;
		}

		boolean cointainsZero(int bit) {
			return countZeros > 0;
		}

		public String toString() {
			return countOnes + "\n" + countZeros;
		}
	}

	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String l[];
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		int n = Integer.parseInt(bf.readLine());
		StringBuffer sb = new StringBuffer();
		Trei tmp, trei = new Trei();
		while (n-- > 0) {
			l = bf.readLine().split(" ");
			char c = l[0].charAt(0);
			long curr = Integer.parseInt(l[1]);
			tmp = trei;
			if (c == '+') {
				for (int i = maxBits - 1; i >= 0; i--) {
					if ((curr & (1 << i)) == 0) {
						tmp.insertZeros(i);
						tmp = tmp.zeros;
					} else {
						tmp.insertOnes(i);
						tmp = tmp.ones;
					}
				}
			} else if (c == '-') {
				for (int i = maxBits - 1; i >= 0; i--) {
					if ((curr & (1 << i)) == 0) {
						tmp.removeZeros(i);
						tmp = tmp.zeros;
					} else {
						tmp.removeOnes(i);
						tmp = tmp.ones;
					}
				}
			} else {
				long ans = 0;
				for (int i = maxBits - 1; i >= 0; i--) {
					if ((curr & (1 << i)) == 0) {
						if (tmp != null && tmp.containsOne(i)) {
							ans ^= (1 << i);
							tmp = tmp.ones;
						} else {
							if (tmp != null)
								tmp = tmp.zeros;
						}
					} else {
						if (tmp != null && tmp.cointainsZero(i)) {
							tmp = tmp.zeros;
						} else {
							ans ^= (1 << i);
							if (tmp != null)
								tmp = tmp.ones;
						}
					}
				}
				ans = Math.max(ans ^ curr, curr ^ 0);
				sb.append(ans + "\n");
			}
		}
		System.out.print(sb);
	}

}