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.lang.*;
import java.math.*;
import java.util.*;

public class A extends cf {
    public static void main(String[] args) {A a = new A();}

    public void run(InputReader in, PrintWriter out) {
        int q = in.nextInt();
        List<Map<Integer, Integer>> map = new ArrayList<>();
        for (int i = 0; i < 30; i++) {
            map.add(new HashMap<>());
        }

        for (int i = 0; i < q; i++) {
            String tp = in.next();
            int x = in.nextInt();
            StringBuilder s = new StringBuilder(Integer.toBinaryString(x)).reverse();
            while (s.length() < 30) {
                s.append("0");
            }
            s = s.reverse();

            if (tp.equals("+")) {
                int k = 0;
                for (int j = 0; j < s.length(); j++) {
                    k *= 2;
                    if (s.charAt(j) == '1') {
                        k++;
                    }
                    map.get(j).put(k, map.get(j).getOrDefault(k, 0) + 1);
                }
            }
            else if (tp.equals("-")) {
                int k = 0;
                for (int j = 0; j < s.length(); j++) {
                    k *= 2;
                    if (s.charAt(j) == '1') {
                        k++;
                    }
                    map.get(j).put(k, map.get(j).getOrDefault(k, 0) - 1);
                }
            }
            else {
                int k = 0;
                for (int j = 0; j < s.length(); j++) {
                    k *= 2;
                    if (s.charAt(j) == '0') {
                        if (map.get(j).getOrDefault(k + 1, 0) > 0) {
                            k++;
                        }
                    }
                    else {
                        if (map.get(j).getOrDefault(k, 0) <= 0) {
                            k++;
                        }
                    }
                }
                out.println(Math.max(x ^ k, x));
            }
        }
    }
}

class cf {
    public cf() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        run(in, out);
        out.close();
    }

    public void run(InputReader in, PrintWriter out) {}
}

class InputReader {
    private BufferedReader br;
    private StringTokenizer st;

    public InputReader(InputStream stream) {
        br = new BufferedReader(new InputStreamReader(stream), 32768);
        st = null;
    }

    public String next() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return st.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int  i =0; i < n; i++) {
            a[i] = nextInt();
        }
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = nextLong();
        }
        return a;
    }

    public double[] nextDoubleArray(int n) {
        double[] a = new double[n];
        for (int i = 0; i < n; i++) {
            a[i] = nextDouble();
        }
        return a;
    }

    public char[] nextCharArray() {
        return next().toCharArray();
    }
}