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 D {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int c = in.nextInt();
		TreeMap<Integer, Integer> set = new TreeMap<>();
		set.put(0, 1);

		for (int i = 0; i < c; i++) {
			char op = in.next().charAt(0);
			int n = in.nextInt();
			if (op == '+') {
				if (!set.containsKey(n)) {
					set.put(n, 0);
				}
				set.put(n, set.get(n) + 1);
			} else if (op == '-') {
				set.put(n, set.get(n) - 1);
				if (set.get(n) == 0) {
					set.remove(n);
				}
			} else {
				int res = 0;
				for (int bit = 1<<30; bit > 0; bit = bit / 2) {
					//System.err.println("BIT #" + bit + ": " + res);

					int wantBit = (~(n & bit)) & bit;
					if (wantBit == 0) {
						Integer f = set.ceilingKey(res);
						//System.err.println("WANT 0, f = " + f);
						if ( f != null && f >= bit + res ) {
							res += bit;
						}
					} else {
						Integer f = set.ceilingKey(new Integer(res + bit));
						//System.err.println("WANT 1, f = " + f);
						if (f != null && f.compareTo(new Integer(2*bit + res)) < 0) {
							res += bit;
						}
					}
				}
				System.out.println(n ^ res);
			}
		}
	}
}
