#include <bits/stdc++.h>
const int MAX_N = 1e5;
struct Segt {
  int l, r;
  Segt *lc, *rc;
  int sum;
  long long a[5];
  Segt(int l, int r, Segt *lc, Segt *rc) : l(l), r(r), lc(lc), rc(rc), sum(0) {}
  void update() {
    sum = lc->sum + rc->sum;
    memset(a, 0, sizeof(a));
    int d = lc->sum % 5;
    for (int i = 0; i < 5; i++) {
      a[i] += lc->a[i];
      a[i] += rc->a[(i - d + 5) % 5];
    }
  }
  void add(int pos, int val) {
    if (l == r) {
      sum = 1;
      a[1] = val;
    } else {
      int mid = l + (r - l) / 2;
      if (pos <= mid)
        lc->add(pos, val);
      else if (pos > mid)
        rc->add(pos, val);
      update();
    }
  }
  void del(int pos, int val) {
    if (l == r) {
      sum = 0;
      a[1] = 0;
    } else {
      int mid = l + (r - l) / 2;
      if (pos <= mid)
        lc->del(pos, val);
      else if (pos > mid)
        rc->del(pos, val);
      update();
    }
  }
  static Segt *build(int l, int r) {
    if (l == r)
      return new Segt(l, r, NULL, NULL);
    else {
      int mid = l + (r - l) / 2;
      return new Segt(l, r, build(l, mid), build(mid + 1, r));
    }
  }
} * segt;
int n;
struct Operation {
  int type, x;
} opt[MAX_N + 1];
int a[MAX_N + 1], tot;
int size;
std::map<int, int> mp;
int main() {
  scanf("%d", &n);
  memset(a, 0, sizeof(a));
  char s[10];
  for (int i = 1; i <= n; i++) {
    scanf("%s", s);
    if (s[0] == 'a') {
      opt[i].type = 1;
      scanf("%d", &opt[i].x);
      a[++tot] = opt[i].x;
    } else if (s[0] == 'd') {
      opt[i].type = 2;
      scanf("%d", &opt[i].x);
    } else if (s[0] == 's') {
      opt[i].type = 3;
    }
  }
  std::sort(a + 1, a + tot + 1);
  size = std::unique(a + 1, a + tot + 1) - a - 1;
  segt = Segt::build(1, size);
  for (int i = 1; i <= tot; i++) mp[a[i]] = i;
  for (int i = 1; i <= n; i++) {
    if (opt[i].type == 1) {
      segt->add(mp[opt[i].x], opt[i].x);
    } else if (opt[i].type == 2) {
      segt->del(mp[opt[i].x], opt[i].x);
    } else if (opt[i].type == 3) {
      printf("%I64d\n", segt->a[3]);
    }
  }
  return 0;
}
