#include <bits/stdc++.h>
using namespace std;
int m, n, sz, cnt;
int a[1000], b[1000];
long long sum[1000][5];
int str[1000];
int q[100010][2];
pair<int, int> num[100010];
bool mark[100010];
int bs(int x) {
  int l = 0, r = n - 1;
  while (l < r) {
    int mid = (l + r) / 2;
    if (num[mid].first >= x)
      r = mid;
    else
      l = mid + 1;
  }
  return l;
}
void inc(int idx) {
  for (int i = idx; i < cnt; i++) {
    str[i]++;
    if (str[i] == 5) str[i] = 0;
    long long t = sum[i][4];
    for (int j = 4; j > 0; j--) sum[i][j] = sum[i][j - 1];
    sum[i][0] = t;
  }
}
void dec(int idx) {
  for (int i = idx; i < cnt; i++) {
    str[i]--;
    if (str[i] == -1) str[i] = 4;
    long long t = sum[i][0];
    for (int j = 0; j < 4; j++) sum[i][j] = sum[i][j + 1];
    sum[i][4] = t;
  }
}
void setSum(int idx) {
  for (int i = 0; i < 5; i++) sum[idx][i] = 0;
  int p = str[idx];
  for (int i = a[idx]; i <= b[idx]; i++) {
    if (!mark[i]) continue;
    sum[idx][p] += num[i].first;
    p++;
    if (p == 5) p = 0;
  }
}
int main() {
  char s[10];
  while (cin >> m) {
    n = 0;
    memset(mark, false, sizeof mark);
    memset(sum, 0, sizeof sum);
    memset(str, 0, sizeof str);
    for (int i = 0; i < m; i++) {
      scanf("%s", s);
      if (s[0] == 'a') {
        scanf("%d", &q[i][1]);
        q[i][0] = 0;
        num[n++] = pair<int, int>(q[i][1], n);
      }
      if (s[0] == 'd') {
        scanf("%d", &q[i][1]);
        q[i][0] = 1;
      }
      if (s[0] == 's') q[i][0] = 2;
    }
    sort(num, num + n);
    sz = (int)sqrt(5. * n);
    cnt = 0;
    int p = 0;
    while (p < n) {
      a[cnt] = p;
      b[cnt] = min(n - 1, p + sz - 1);
      p = b[cnt++] + 1;
    }
    for (int Q = 0; Q < m; Q++) {
      if (q[Q][0] == 0) {
        int idx = bs(q[Q][1]);
        mark[idx] = true;
        setSum(idx / sz);
        inc(idx / sz + 1);
      }
      if (q[Q][0] == 1) {
        int idx = bs(q[Q][1]);
        mark[idx] = false;
        setSum(idx / sz);
        dec(idx / sz + 1);
      }
      if (q[Q][0] == 2) {
        long long res = 0;
        for (int i = 0; i < cnt; i++) res += sum[i][2];
        cout << res << endl;
      }
    }
  }
  return 0;
}
