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.*;
import java.io.*;

public class R706D {
    FastScanner in;
    PrintWriter out;

    void solve() {
        int q=in.nextInt(), x, sz=1;
        node[] a=new node[q*33];
        a[0]=new node();
        String t;

        for(int i=0; i<=q; i++) {
            if (i==0) {
                t="+";
                x=0;
            }
            else {
                t=in.next();
                x=in.nextInt();
            }
            int v=0;
            if (t.equals("+")) {
                int[] b=to2(x);
                for(int j=0; j<32; j++) {
                    if (b[j]==0) {
                        a[v].c0++;
                        if (a[v].c0>1)
                            v=a[v].n0;
                        else {
                            v=a[v].n0=sz++;
                            a[v]=new node();
                        }
                    } else {
                        a[v].c1++;
                        if (a[v].c1>1)
                            v=a[v].n1;
                        else {
                            v=a[v].n1=sz++;
                            a[v]=new node();
                        }
                    }
                }
            }
            else if (t.equals("-")) {
                int[] b=to2(x);
                for(int j=0; j<32; j++) {
                    if (b[j]==0) {
                        a[v].c0--;
                        v=a[v].n0;
                    } else {
                        a[v].c1--;
                        v=a[v].n1;
                    }
                }
            }
            else {
                int ans=0;
                int[] b=to2(x);
                for(int j=0; j<32; j++)
                    if (b[j]==1) {
                        if (a[v].c0>0) {
                            ans+=(1<<31-j);
                            v=a[v].n0;
                        }
                        else v=a[v].n1;
                    }
                    else {
                        if (a[v].c1>0) {
                            ans+=(1<<31-j);
                            v=a[v].n1;
                        }
                        else v=a[v].n0;
                    }
                System.out.println(ans);
            }
        }
    }
    int[] to2(int x) {
        int[] b=new int[32];
        for(int i=0; i<32; i++) {
            b[31-i]=x%2;
            x/=2;
        }
        return b;
    }
    class node {
        int c0=0;
        int c1=0;
        int n0=0;
        int n1=0;
    }

    void run() {
        try {
            in = new FastScanner(new File("CF.in"));
            out = new PrintWriter(new File("CF.out"));

            solve();

            out.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }

    void runIO() {

        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);

        solve();

        out.close();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        public FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }

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

        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }

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

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

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

    public static void main(String[] args) {
        new R706D().runIO();
    }

}
