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


public class CandidateCode {
    public static void main(String[] args) throws IOException {
        FastReader sc = new FastReader();
        root=new TrieNode();
        addDelete(0,false);
        int q=sc.nextInt();
        StringBuilder sb=new StringBuilder();
        while (q-->0){
            char x=sc.next().charAt(0);
            int y=sc.nextInt();
            if (x=='+'){
                addDelete(y,false);
            }else if (x=='-'){
                addDelete(y,true);
            }else {
                int ans=max(y);
                sb.append((ans^y)+"\n");
            }
        }
        System.out.print(sb);
    }
    static TrieNode root;
    static class TrieNode{
        TrieNode next[];
        int cnt;
        TrieNode(){
            next=new TrieNode[2];
            cnt=0;
        }
    }
    static void addDelete(int x,boolean delete){
        TrieNode tmp=root;
        for (int i=30;i>=0;i--){
            int bit=0;
            if ((x&(1<<i))!=0)bit++;
            if (tmp.next[bit]==null){
                tmp.next[bit]=new TrieNode();
            }
            tmp=tmp.next[bit];
            if (delete){
                tmp.cnt--;
            }else {
                tmp.cnt++;
            }
        }
    }
    static int max(int x){
        int max=0;
        TrieNode tmp=root;
        for (int i=30;i>=0;i--){
            int bit=0;
            if ((x&(1<<i))!=0){
                bit++;
            }
            if (tmp.next[bit^1]!=null && tmp.next[bit^1].cnt>0){
                tmp=tmp.next[bit^1];
                bit^=1;
                max=(max|(bit<<i));
            }else {
                tmp=tmp.next[bit];
                max=(max|(bit<<i));
            }
        }
        return max;
    }

    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) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}