#include <bits/stdc++.h>
using namespace std;
const int inf = ~0U >> 1;
struct treap {
  struct node {
    int val, key, size;
    node* c[2];
    long long sum[5];
    node(int v, node* n) {
      c[0] = c[1] = n;
      size = 1;
      key = rand() - 1;
      val = v;
      for (int i = 0; i < 5; i++) sum[i] = 0;
      sum[1] = v;
    }
    void rz() {
      size = c[0]->size + c[1]->size + 1;
      for (int i = 0; i < 5; i++) {
        sum[i] = c[0]->sum[i];
      }
      sum[(c[0]->size + 1) % 5] += val;
      for (int i = 0; i < 5; i++) {
        sum[(c[0]->size + 1 + i) % 5] += c[1]->sum[i];
      }
    }
  } * root, *null;
  treap() {
    null = new node(0, 0);
    null->size = 0;
    null->key = inf;
    root = null;
  }
  void rot(node*& t, bool d) {
    node* p = t->c[d];
    t->c[d] = p->c[!d];
    p->c[!d] = t;
    t->rz();
    p->rz();
    t = p;
  }
  void _insert(node*& t, int x) {
    if (t == null) {
      t = new node(x, null);
      return;
    }
    bool d = x > t->val;
    _insert(t->c[d], x);
    if (t->c[d]->key < t->key)
      rot(t, d);
    else
      t->rz();
  }
  void _del(node*& t, int x) {
    if (t == null) return;
    if (t->val == x) {
      bool d = t->c[1]->key < t->c[0]->key;
      if (t->c[d] == null) {
        delete t;
        t = null;
        return;
      }
      rot(t, d);
      _del(t->c[!d], x);
    } else {
      bool d = x > t->val;
      _del(t->c[d], x);
    }
    t->rz();
  }
  int _select(node* t, int k) {
    int r = t->c[0]->size;
    if (k == r) return t->val;
    if (k < r)
      return _select(t->c[0], k);
    else
      return _select(t->c[1], k - r - 1);
  }
  int rank(node* t, int x) {
    if (t == null) return 0;
    int r = t->c[0]->size;
    if (x == t->val) return r;
    if (x < t->val)
      return rank(t->c[0], x);
    else
      return r + 1 + rank(t->c[1], x);
  }
  void ins(int x) { _insert(root, x); }
  int sel(int k) {
    if (k > root->size) return -inf;
    return _select(root, k - 1);
  }
  int ran(int x) { return rank(root, x); }
  void del(int x) { _del(root, x); }
} T;
int main() {
  int m;
  scanf("%d\n", &m);
  srand(time(0));
  char s[5];
  int n;
  while (m--) {
    scanf("%s", s);
    if (s[0] != 's') scanf("%d", &n);
    if (s[0] == 'a')
      T.ins(n);
    else if (s[0] == 'd')
      T.del(n);
    else
      printf("%I64d\n", T.root->sum[3]);
  }
}
