Problem: In one well-known algorithm of finding the k-th order statistics we should divide all elements into groups of five consecutive elements and find the median of each five. A median is called the middle element of a sorted array (it's the third largest element for a group of five). To increase the algorithm's performance speed on a modern video card, you should be able to find a sum of medians in each five of the array.

A sum of medians of a sorted k-element set S = {a1, a2, ..., ak}, where a1 < a2 < a3 < ... < ak, will be understood by as 

<image>

The <image> operator stands for taking the remainder, that is <image> stands for the remainder of dividing x by y.

To organize exercise testing quickly calculating the sum of medians for a changing set was needed.

Input

The first line contains number n (1 ≤ n ≤ 105), the number of operations performed.

Then each of n lines contains the description of one of the three operations: 

  * add x — add the element x to the set; 
  * del x — delete the element x from the set; 
  * sum — find the sum of medians of the set. 



For any add x operation it is true that the element x is not included in the set directly before the operation.

For any del x operation it is true that the element x is included in the set directly before the operation.

All the numbers in the input are positive integers, not exceeding 109.

Output

For each operation sum print on the single line the sum of medians of the current set. If the set is empty, print 0.

Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams (also you may use the %I64d specificator).

Examples

Input

6
add 4
add 5
add 1
add 2
add 3
sum


Output

3


Input

14
add 1
add 7
add 2
add 5
sum
add 6
add 8
add 9
add 3
add 4
add 10
sum
del 1
sum


Output

5
11
13

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.*;

public class D implements Runnable {
	private final boolean useStandardIO = true;
	private final String inFile = ".in";
	private final String outFile = ".out";

	class Command {
		String name;
		int x;
	}

	List<Long> brute(List<Command> commands) {
		SortedSet<Long> h = new TreeSet<Long>();
		List<Long> res = new ArrayList<Long>();
		for (Command c : commands) {
			if (c.name.equals("sum")) {
				long rr = 0;
				int i = 0;
				for (long r : h) {
					if ((++i) % 5 == 3)
						rr += r;
				}
				res.add(rr);
			} else if (c.name.equals("add")) {
				h.add((long) c.x);
			} else {
				h.remove((long) c.x);
			}
		}
		return res;
	}

	List<Long> solve(List<Command> commands) throws Exception {
		List<Integer> all = new ArrayList<Integer>();
		for (Command c : commands) {
			if (c.name.equals("sum")) {
			} else {
				all.add(c.x);
			}
		}
		Collections.sort(all);
		Map<Integer, Integer> hm = new HashMap<Integer, Integer>();
		int z = 0;
		for (int i = 0; i < all.size(); ++i)
			if (i == 0 || ((int)all.get(i)) != (int)all.get(i - 1)) {
				hm.put(all.get(i), z++);
			}
		Node root = createTree(0, hm.size());
		List<Long> res = new ArrayList<Long>();
		HashSet<Integer> hhh = new HashSet<Integer>();
		for (Command c : commands) {
			if (c.name.equals("sum")) {
				res.add(getSum(root));
			} else if (c.name.equals("add")) {
				if (hhh.contains(c.x))
					throw new Exception();
				hhh.add(c.x);
				add(root, hm.get(c.x), c.x);
			} else if (c.name.equals("del")) {
				if (!hhh.contains(c.x))
					throw new Exception();
				hhh.remove(c.x);
				delete(root, hm.get(c.x), c.x);
			} else
				throw new Exception();
		}
		return res;
	}

	private void solve() throws Exception {
		/*
		 * List<Command> cc = new ArrayList<Command>();
		 * 
		 * Random r = new Random(123); for (int i = 1; i <= 10000; ++i) { int k
		 * = r.nextInt(100); Command c = new Command(); c.name = "add " + i +
		 * 1000000; cc.add(c);
		 * 
		 * c = new Command(); c.name = "sum"; cc.add(c);
		 * 
		 * if (i % 4 == 0) { c = new Command(); c.name = "del " + i + 1000000;
		 * cc.add(c); } }
		 * 
		 * List<Long> my = solve(cc); List<Long> br = brute(cc);
		 * 
		 * if (my.size() != br.size()) { throw new Exception(); }
		 * 
		 * for (int i = 0; i < my.size(); ++i) if (my.get(i) != br.get(i)) throw
		 * new Exception();
		 */

		int n = nextInt();
		List<Command> cmds = new ArrayList<Command>();
		for (int i = 0; i < n; ++i) {
			String cmd = nextToken();
			Command c = new Command();
			if (cmd.equals("sum")) {
			} else if (cmd.equals("add") || cmd.equals("del")) {
				long x = nextLong();
				if (x < 1 || x > 1000000000)
					throw new Exception();
				c.x = (int) x;
			} else
				throw new Exception();
			c.name = cmd;
			cmds.add(c);
		}
		for (long r : n < 1000 ? brute(cmds) : solve(cmds))
			writer.println(r);

	}

	void add(Node t, int u, long real) {
		int mid = (t.L + t.R) / 2;
		if (t.L == t.R) {
			t.sum[0] = real;
			t.cnt = 1;
		} else {
			if (u <= mid) {
				add(t.l, u, real);
			} else {
				add(t.r, u, real);
			}
			t.cnt++;
			for (int i = 0; i < 5; ++i)
				t.sum[i] = t.l.sum[i] + t.r.sum[((i - t.l.cnt) % 5 + 5) % 5];
		}
	}

	void delete(Node t, int u, long real) {
		int mid = (t.L + t.R) / 2;
		if (t.L == t.R) {
			t.sum[0] = 0;
			t.cnt = 0;
		} else {
			if (u <= mid) {
				delete(t.l, u, real);
			} else {
				delete(t.r, u, real);
			}
			t.cnt--;
			for (int i = 0; i < 5; ++i)
				t.sum[i] = t.l.sum[i] + t.r.sum[((i - t.l.cnt) % 5 + 5) % 5];
		}
	}

	long getSum(Node t) {
		return t.sum[2];
	}

	Node createTree(int L, int R) {
		Node t = new Node();
		t.sum = new long[5];
		t.cnt = 0;
		t.L = L;
		t.R = R;
		if (L < R) {
			int mid = (L + R) / 2;
			t.l = createTree(L, mid);
			t.r = createTree(mid + 1, R);
		}
		return t;
	}

	class Node {
		Node l, r;
		long[] sum;
		int cnt, L, R;
	}

	public static void main(String[] args) {
		new Thread(null, new D(), "", 64 * 1024 * 1024).run();
	}

	BufferedReader reader;
	StringTokenizer tokenizer;
	PrintWriter writer;

	public void run() {
		try {
			try {
				Locale.setDefault(Locale.US);
			} catch (Exception e) {
			}
			if (useStandardIO) {
				reader = new BufferedReader(new InputStreamReader(System.in));
				writer = new PrintWriter(System.out);
			} else {
				reader = new BufferedReader(new FileReader(inFile));
				writer = new PrintWriter(new FileWriter(outFile));
			}
			tokenizer = null;
			solve();
			reader.close();
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	BigInteger nextBigInteger() throws IOException {
		return new BigInteger(nextToken());
	}

	String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}
}