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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        //
        OutputStream out = new BufferedOutputStream(System.out);
        FastReader sc = new FastReader();
        int q = sc.nextInt();
        node root = new node();
        int x = 0;
        String xi = String.format("%32s", Integer.toBinaryString(x)).replaceAll(" ", "0");
        build(xi, root);
        for (int i = 0; i < q; i++) {
            String qi = sc.next();
            x = sc.nextInt();
            xi = String.format("%32s", Integer.toBinaryString(x)).replaceAll(" ", "0");
            if (qi.equals("+")) {
                build(xi, root);
            } else if (qi.equals("-")) {
                remove(xi, root);
            } else {
                out.write((xor(xi, root) + "\n").getBytes());
                out.flush();
            }
        }
    }

    static int xor(String num, node root) {
        node temp = root;
        int ans = 0;
        for (int i = 0, j = 31; i < 32; i++, j--) {
            if (num.charAt(i) == '1') {
                if (temp.right == null) {
                    temp = temp.left;
                } else {
                    if (temp.numbRight > 0) {
                        temp = temp.right;
                        ans += Math.pow(2, j);
                    } else {
                        temp = temp.left;
                    }
                }
            } else {
                if (temp.left == null) {
                    temp = temp.right;
                } else {
                    if (temp.numbLeft > 0) {
                        temp = temp.left;
                        ans += Math.pow(2, j);
                    } else {
                        temp = temp.right;
                    }
                }
            }
        }
        return ans;
    }

    static void remove(String num, node root) {
        node temp = root;
        for (int i = 0; i < num.length(); i++) {
            if (num.charAt(i) == '1') {
                temp.numbLeft--;
                temp = temp.left;
            } else {
                temp.numbRight--;
                temp = temp.right;
            }
        }
    }

    static void build(String num, node root) {
        node temp = root;
        for (int i = 0; i < num.length(); i++) {
            if (num.charAt(i) == '1') {
                if (temp.left == null) {
                    temp.left = new node();
                    temp.numbLeft++;
                    temp = temp.left;
                } else {
                    temp.numbLeft++;
                    temp = temp.left;
                }
            } else {
                if (temp.right == null) {
                    temp.right = new node();
                    temp.numbRight++;
                    temp = temp.right;
                } else {
                    temp.numbRight++;
                    temp = temp.right;
                }
            }
        }
    }

    static class node {

        node left;
        node right;
        int numbLeft;
        int numbRight;

        node() {
            left = null;
            right = null;
            numbLeft = 0;
            numbRight = 0;
        }
    }

    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {

                }
            }
            return st.nextToken();
        }

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

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

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

    }
}
