#include <bits/stdc++.h>
using namespace std;
template <class T>
inline int size(const T& t) {
  return t.size();
}
int ile[2 * (1 << 17)];
long long res[2 * (1 << 17)][5];
int N, ile_l = 0;
char op[100000];
int num[100000];
int val2[100000];
pair<int, int> val[100000];
void wstaw(int pos, int mn) {
  int cur = (1 << 17) + pos;
  ile[cur] += mn;
  res[cur][0] += mn * val2[pos];
  while (cur > 1) {
    cur /= 2;
    ile[cur] = ile[2 * cur] + ile[2 * cur + 1];
    for (int a = 0; a < (5); ++a)
      res[cur][a] =
          res[2 * cur][a] + res[2 * cur + 1][(a + 5 - ile[2 * cur] % 5) % 5];
  }
}
int main() {
  while (scanf("%d", &N) != EOF) {
    memset(op, 0, sizeof(op));
    memset(num, 0, sizeof(num));
    memset(val2, 0, sizeof(val2));
    memset(val, 0, sizeof(val));
    memset(ile, 0, sizeof(ile));
    memset(res, 0, sizeof(res));
    for (int a = 0; a < (N); ++a) {
      char buf[10];
      scanf("%s", buf);
      op[a] = buf[0];
      if (buf[0] == 's') continue;
      scanf("%d", &val[ile_l].first);
      val[ile_l].second = a;
      ile_l++;
    }
    sort(val, val + ile_l);
    int xx = 0;
    for (int a = 0; a < (ile_l); ++a) {
      if (!xx || val[a].first != val2[xx - 1]) {
        val2[xx] = val[a].first;
        ++xx;
      }
      num[val[a].second] = xx - 1;
    }
    for (int a = 0; a < (N); ++a)
      if (op[a] == 's')
        cout << res[1][2] << '\n';
      else
        wstaw(num[a], op[a] == 'a' ? 1 : -1);
  }
}
