import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {
	static Scanner in = new Scanner(System.in);
	static final int maxn = 100010;
	static int va[] = new int[maxn];
	static class Node{
		int num;
		long sumv[] = new long[5];
		Node(){
			num = 0;
			for(int i=0;i<5;i++)
				sumv[i] = 0;
		}
	}
	static class SegTree{
		Node node[] = new Node[maxn*4];
		void init(int n){
			for(int i=0;i<(n+2)*4;i++)
				node[i] = new Node();
			
		}
		void update(int o,int L,int R,int p,int v){
			if(L==R){
				node[o].num=v;
				node[o].sumv[1]=v==1?(long)va[L]:0;
			}else{
				int M=L+(R-L)/2;
				if(p<=M) update(o*2, L, M, p, v);
				else update(o*2+1, M+1, R, p, v);
				maintain(o,L,R);
			}
		}
		private void maintain(int o, int L, int R) {
			int lc = o*2 , rc = o*2+1 ,num = node[o*2].num;
			node[o].num = node[lc].num + node[rc].num;
			for(int i=0;i<4;i++){
				node[o].sumv[i] = node[lc].sumv[i] + node[rc].sumv[(5-num%5+i)%5];
			}
		}
	}
	static SegTree T = new SegTree();
	public static void main(String[] args) {
	    int n = in.nextInt();
	    String op[] = new String[maxn];
	    int v[] = new int[maxn];
	    int l=0;
	    for(int i=0;i<n;i++){
	    	op[i] = in.next();
	    	if(!op[i].equals("sum")){
	    		v[i] = in.nextInt();
	    		va[++l] = v[i];
	    	}
	    }
	    T.init(n);
	    int len = 1;
	    Arrays.sort(va,1,l+1);
	    for(int i=2;i<=l;i++)
	    	if(va[i]!=va[i-1]) va[++len]=va[i];
	    for(int i=0;i<n;i++){
	    	if(op[i].equals("sum")){
	    		System.out.println(T.node[1].sumv[3]);
	    	}else{
	    		int p = getPos(v[i], len);
	    		int vv = op[i].equals("add")?1:0;
	    		T.update(1, 1, n, p, vv);
	    	}
	    }
	}
	private static int getPos(int a,int n) {
		int le = 1,ri = n;
		while(le<ri){
			int mid = (le+ri)/2;
			if(va[mid]<a) le=mid+1;
			else ri=mid;
		}
		return le;
	}
}

 						 	 	   	  		    			   		