#include <bits/stdc++.h>
using namespace std;
int n, q;
string s;
const int maxn = 1e5 + 5;
long long a[maxn];
struct opt {
  long long x, op;
} p[maxn];
struct tree {
  int l, r, cnt;
  long long sum[5];
} tr[maxn << 2];
void push_up(int now) {
  tr[now].cnt = tr[now << 1].cnt + tr[now << 1 | 1].cnt;
  for (int i = 0; i < 5; ++i) tr[now].sum[i] = 0;
  for (int i = 0; i < 5; ++i) {
    tr[now].sum[i] += tr[now << 1].sum[i];
    tr[now].sum[(i + tr[now << 1].cnt) % 5] += tr[now << 1 | 1].sum[i];
  }
  return;
}
void build(int now, int l, int r) {
  tr[now].l = l;
  tr[now].r = r;
  if (l == r) {
    for (int i = 0; i < 5; ++i) tr[now].sum[i] = 0;
    tr[now].cnt = 0;
    return;
  }
  int mid = (l + r) >> 1;
  build(now << 1, l, mid);
  build(now << 1 | 1, mid + 1, r);
  push_up(now);
  return;
}
void update(int now, int pos) {
  if (tr[now].l == tr[now].r) {
    tr[now].cnt = (tr[now].cnt + 1) % 2;
    if (tr[now].cnt)
      tr[now].sum[1] = a[tr[now].l];
    else
      tr[now].sum[1] = 0;
    return;
  }
  int mid = (tr[now].l + tr[now].r) >> 1;
  if (pos <= mid)
    update(now << 1, pos);
  else
    update(now << 1 | 1, pos);
  push_up(now);
  return;
}
int cnt = 0;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> q;
  cnt = 1;
  for (int i = 0; i < q; ++i) {
    cin >> s;
    if (s[0] == 's')
      p[i].op = 3;
    else {
      cin >> p[i].x;
      if (s[0] == 'a')
        p[i].op = 1;
      else
        p[i].op = 2;
    }
    a[cnt++] = p[i].x;
  }
  sort(a + 1, a + cnt + 1);
  int m = unique(a + 1, a + cnt + 1) - (a + 1);
  build(1, 1, m);
  for (int i = 0; i < q; ++i) {
    if (p[i].op == 3)
      cout << tr[1].sum[3] << "\n";
    else {
      int xp = upper_bound(a + 1, a + m + 1, p[i].x) - (a + 1);
      update(1, xp);
    }
  }
  return 0;
}
