#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const long long linf = 2e18;
const int MOD = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T>
void print(T a) {
  cout << a << endl;
  exit(0);
}
template <class T>
void chmin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void upd(T &a, T b) {
  (a += b) %= MOD;
}
template <class T>
void mul(T &a, T b) {
  a = (long long)a * b % MOD;
}
const int T = 1 << 17;
int sum[T << 1][5];
int cnt[T << 1];
vector<pair<int, int> > qry;
int tot, pm[N];
map<int, int> hsh;
void work(int x) {
  int l = x * 2, r = x * 2 + 1;
  cnt[x] = cnt[l] + cnt[r];
  for (int i = (0); i <= (4); i++)
    sum[x][i] = sum[l][i] + sum[r][(i - cnt[l] % 5 + 5) % 5];
}
signed main() {
  int Q;
  scanf("%d", &Q);
  for (int i = (1); i <= (Q); i++) {
    string st;
    cin >> st;
    if (st[0] == 's') {
      qry.push_back(make_pair(2, 0));
    } else {
      int x;
      scanf("%d", &x);
      qry.push_back(make_pair(st[0] == 'a' ? 0 : 1, x));
      hsh[x] = 0;
    }
  }
  for (map<int, int>::iterator it = hsh.begin(); it != hsh.end(); it++) {
    it->second = tot;
    pm[tot++] = it->first;
  }
  for (int i = (1); i <= (Q); i++) {
    int op = qry[i - 1].first, v = qry[i - 1].second;
    if (op == 2)
      printf("%lld\n", sum[1][2]);
    else {
      int id = T + hsh[v];
      cnt[id] = 1 - op;
      sum[id][0] = cnt[id] * v;
      for (int j = id / 2; j >= 1; j /= 2) work(j);
    }
  }
}
