public class Solution {
/**
* @param args
*/
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long N = in.nextLong();
List<Long> list = new ArrayList<Long>();
for(int i=0; i<N; i++){
String op = in.next();
long number = in.nextLong();
performOperation(op, number, list);
}
}
private static void performOperation(String op, long number, List<Long> list) {
int index = Collections.binarySearch(list, number);
if(op.equalsIgnoreCase("r")){
if(index < 0){
System.out.println("Wrong!");//Doesn't exist
return;
}else{
list.remove(index);//Remove any one occurence
}
}else{
if(index < 0){
list.add(-index-1, number);//Add in sorted list
}else{
list.add(index, number);//Add where the same number exists, should still be sorted.
}
}
if(list.size() == 0){
System.out.println("Wrong!");
}else if(list.size()%2 == 0){
double median = (list.get(list.size()/2) + list.get(list.size()/2 - 1))/2.0;
if(median == Math.ceil(median))
System.out.println((long)median);
else
System.out.println(median);
}else{
System.out.println(list.get((list.size()-1)/2));
}
}
}
