import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeSet;

class Node<T extends Comparable<T>>{
	T info;
	Node<T> left,right;
	boolean isDeleted;
	public Node(T element,Node<T> l,Node<T> r) {
		info = element;
		left = l;
		right = r;
		isDeleted = false;
	}

}

class BinaryTreeSet<T extends Comparable<T>>{
	TreeSet<T> tree;
	String res;

	public BinaryTreeSet() {
		tree=new TreeSet<T>();
		res="";
	}
	public void addElement(T element){
		if(!tree.contains(element))
			tree.add(element);
	}
	public boolean contains(T element){
		return tree.contains(element);
	}
	public boolean removeElement(T element){
		return tree.remove(element);
	}

	@Override
	public String toString() {
		if(tree.isEmpty())return "EMPTY";
		String res  = tree.toString();
		res = res.replace(",","");
		res = res.replace("[", "");
		res = res.replace("]","");
		return res;
	}

}

public class BinaryTreeSetTest {

	public static void main(String[] args) {
		Scanner jin = new Scanner(System.in);
		int t = jin.nextInt();
		if ( t == 0 ) {
			BinaryTreeSet<Integer> ts = new BinaryTreeSet<Integer>();
			while ( jin.hasNextInt() ) {
				ts.addElement(jin.nextInt());
			}
			System.out.println(ts);
		}
		if ( t == 1 ) {
			BinaryTreeSet<String> ts = new BinaryTreeSet<String>();
			while ( true ) {
				String next = jin.next();
				if ( next.equals("stop") ) break;
				ts.addElement(next);
			}
			System.out.println(ts);
		}
		if ( t == 2 ) {
			BinaryTreeSet<Long> ts = new BinaryTreeSet<Long>();
			while ( jin.hasNextLong() ) {
				ts.addElement(jin.nextLong());
			}
			jin.next();
			System.out.println(ts);
			while ( jin.hasNextLong() ) {
				System.out.println(ts.contains(jin.nextLong()));
			}
			System.out.println(ts);
		}
		if ( t == 3 ) {
			BinaryTreeSet<String> ts = new BinaryTreeSet<String>();
			int counter = 0;
			while ( true ) {
				if ( counter % 20 == 0 ) System.out.println(ts);
				++counter;
				String next = jin.next();
				if ( next.equals("stop") ) break;
				if ( next.equals("add") ) {
					ts.addElement(jin.next());
				}
				if ( next.equals("remove") ) {
					ts.removeElement(jin.next());
				}
				if ( next.equals("query") ) {
					System.out.println(ts.contains(jin.next()));
				}
			}
			System.out.println(ts);
		}
		if ( t == 4 ) {
			BinaryTreeSet<Long> ts = new BinaryTreeSet<Long>();
			TreeSet<Long> control_set = new TreeSet<Long>();
			ArrayList<Long> all = new ArrayList<Long>();
			all.add(5L);
			int n = jin.nextInt();
			boolean exact = true;
			for ( int i = 0 ; exact&&i < n ; ++i ) {
				if ( Math.random() < 0.4 ) {
					if ( Math.random() < 0.6 ) {
						long to_add = (long)(Math.random()*98746516548964156L);
						ts.addElement(to_add);
						control_set.add(to_add);
						all.add(to_add);
					}
					else {
						int add_idx = (int)(Math.random()*all.size());
						long to_add = all.get(add_idx);
						ts.addElement(to_add);
						control_set.add(to_add);
					}
				}
				else {
					if ( Math.random() < 0.4 ) {
						if ( Math.random() < 0.1 ) {
							long to_remove = (long)(Math.random()*98746516548964156L);
							ts.removeElement(to_remove);
							control_set.remove(to_remove);
						}
						else {
							int remove_idx = (int)(Math.random()*all.size());
							long to_remove = all.get(remove_idx);
							ts.removeElement(to_remove);
							control_set.remove(to_remove);
						}
					}
					else {
						if ( Math.random() < 0.3 ) {
							long to_query = (long)(Math.random()*98746516548964156L);
							exact &= ts.contains(to_query)==control_set.contains(to_query);
						}
						else {
							int query_idx = (int)(Math.random()*all.size());
							long to_query = all.get(query_idx);
							exact &= ts.contains(to_query)==control_set.contains(to_query);
						}
					}
				}
			}
			System.out.println(exact);
		}
	}

}