#include <bits/stdc++.h>
using namespace std;
mt19937 Rand(time(NULL));
struct tnode {
  int key, siz;
  long long sum[5];
  unsigned int fix;
  tnode *lson, *rson;
  tnode(int x = 0) {
    key = x, siz = 1, sum[0] = x;
    fix = Rand();
    lson = rson = nullptr;
    sum[1] = sum[2] = sum[3] = sum[4] = 0;
  }
  ~tnode() {
    if (lson) delete lson;
    if (rson) delete rson;
  }
  int lsiz() { return lson ? lson->siz : 0; }
  int rsiz() { return rson ? rson->siz : 0; }
  void maintain() {
    siz = lsiz() + rsiz() + 1;
    for (int i = 0; i < (int)(5); ++i) sum[i] = 0;
    if (lson)
      for (int i = 0; i < (int)(5); ++i) sum[i] = lson->sum[i];
    if (rson)
      for (int i = 0; i < (int)(5); ++i)
        sum[(lsiz() + 1 + i) % 5] += rson->sum[i];
    sum[lsiz() % 5] += key;
  }
};
namespace Treap {
tnode* tre;
void init() {
  if (tre) delete tre;
  tre = nullptr;
}
void leftRotate(tnode*& cur) {
  tnode* t = cur->rson;
  cur->rson = t->lson;
  t->lson = cur;
  cur = t;
  t = cur->lson;
  t->maintain(), cur->maintain();
}
void rightRotate(tnode*& cur) {
  tnode* t = cur->lson;
  cur->lson = t->rson;
  t->rson = cur;
  cur = t;
  t = cur->rson;
  t->maintain(), cur->maintain();
}
void insert(tnode*& cur, int val) {
  if (!cur) {
    cur = new tnode(val);
    return;
  }
  cur->siz++;
  if (val < cur->key) {
    insert(cur->lson, val);
    if (cur->lson->fix < cur->fix) rightRotate(cur);
  } else {
    insert(cur->rson, val);
    if (cur->rson->fix < cur->fix) leftRotate(cur);
  }
  cur->maintain();
}
void remove(tnode*& cur, int val) {
  cur->siz--;
  if (val == cur->key) {
    if (!cur->lson || !cur->rson) {
      tnode* t = cur;
      if (!cur->lson)
        cur = cur->rson, t->rson = nullptr;
      else
        cur = cur->lson, t->lson = nullptr;
      delete t;
      return;
    } else {
      cur->siz++;
      if (cur->lson->fix < cur->rson->fix)
        rightRotate(cur), remove(cur->rson, val);
      else
        leftRotate(cur), remove(cur->lson, val);
      cur->siz--;
    }
  } else if (val < cur->key)
    remove(cur->lson, val);
  else
    remove(cur->rson, val);
  cur->maintain();
}
}  // namespace Treap
int N;
int main() {
  scanf("%d", &N);
  Treap::init();
  for (int i = 0; i < (int)(N); ++i) {
    string s;
    int x;
    cin >> s;
    if (s[0] == 'a') {
      scanf("%d", &x);
      Treap::insert(Treap::tre, x);
    }
    if (s[0] == 'd') {
      scanf("%d", &x);
      Treap::remove(Treap::tre, x);
    }
    if (s[0] == 's') printf("%lld\n", Treap::tre ? Treap::tre->sum[2] : 0);
  }
  return 0;
}
