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.lang.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.*;
 
public class Main {
        
    public static void main(String[] args) throws Exception{
        FastReader sc=new FastReader(); 
        OutputStream outputStream = System.out;
        PrintWriter out = new PrintWriter(outputStream);
        int n=sc.nextInt();
        trie t=new trie('0',2);
        String an="";
        for(int i=0;i<32;i++) {
            an+="0";
        }
        t.insert(an, 0);
        while(n>0) {
            n--;
            String s=sc.next();
            String num=Integer.toBinaryString(sc.nextInt());
            String ans="";
            for(int i=0;i<32-num.length();i++) {
                ans+="0";
            }
            ans+=num;
            if(s.equals("+")) {
                t.insert(ans, 0);
            }
            else if(s.equals("-")) {
                t.delete(ans, 0);
            }
            else if(s.equals("?")) {
                System.out.println(t.query(ans, 0));
            }
            else {
                System.out.println(t.find(ans, 0));
            }
        }
        
    }
}
class trie{
    char val;
    int present;
    int size;
    int occur;
    trie[] arr;
    trie(char value,int size) {
        this.size=size;
        this.val=value;
        arr=new trie[size];
    }
    public void insert(String s,int index) {
        this.occur++;
        if(index==s.length()) {
            this.present++;
            return;
        }
        int pos=s.charAt(index)-'0';
        if(this.arr[pos]==null) {
            this.arr[pos]=new trie(s.charAt(index),size);
        }
        this.arr[pos].insert(s, index+1);
    }
    public boolean find(String s,int index) {
        if(index==s.length()) {
            if(this.present>=1) {
                return true;
            }
            else {
                return false;
            }
        }
        int pos=s.charAt(index)-'0';
        if(this.arr[pos]==null) {
            return false;
        }
        else {
            return this.arr[pos].find(s, index+1);
        }
    }
    public boolean delete(String s,int index) {
        if(index==s.length()) {
            if(this.present>=1) {
                this.present-=1;
                this.occur-=1;
                return true;
            }
            return false;
        }
        int pos=s.charAt(index)-'0';
        if(this.arr[pos]==null) {
            return false;
        }
        else {
            if(this.arr[pos].delete(s, index+1)) {
                if(this.arr[pos].occur<=0) {
                    this.arr[pos]=null;
                }
                this.occur-=1;
                return true;
            }
            else {
                return false;
            }
        }
    }
    public int query(String s,int index) {
        if(index==32) {
            return 0;
        }
        if(this.arr[1-(s.charAt(index)-'0')]!=null) {
            return this.arr[1-(s.charAt(index)-'0')].query(s, index+1)+(int)Math.pow(2, 31-index);
        }
        else if(this.arr[(s.charAt(index)-'0')]!=null){
            return this.arr[s.charAt(index)-'0'].query(s, index+1);
        }
        else {
            return 0;
        }
    }
    
}
class node{
    
}
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; 
    } 
} 
