#include <bits/stdc++.h>
using namespace std;
long long n;
const long long N = 1e5 + 100;
long long val[N], num, m = 150, blo;
pair<long long, long long> ope[N];
vector<long long> ve;
void myinit() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    string ss;
    cin >> ss;
    if (ss == "add") {
      ope[i].first = 1;
      cin >> ope[i].second;
      ve.push_back(ope[i].second);
    } else if (ss == "del") {
      ope[i].first = 2;
      cin >> ope[i].second;
    } else
      ope[i].first = 3;
  }
  sort(ve.begin(), ve.end());
  ve.erase(unique(ve.begin(), ve.end()), ve.end());
  num = ve.size(), blo = m == 0 ? 0 : ((num - 1) / m + 1);
  for (long long i = 1; i <= n; i++)
    if (ope[i].first != 3) {
      long long tmp = ope[i].second;
      ope[i].second =
          lower_bound(ve.begin(), ve.end(), ope[i].second) - ve.begin() + 1;
      val[ope[i].second] = tmp;
    }
}
long long sum[N][5];
set<long long> second[N];
void add(long long x) {
  long long p = (x - 1) / m + 1;
  long long s = 0;
  for (long long i = 1; i <= p - 1; i++) s = (s + second[i].size()) % 5;
  second[p].insert(x);
  memset(sum[p], 0, sizeof(sum[p]));
  long long t = (s + 1) % 5;
  for (set<long long>::iterator it = second[p].begin(); it != second[p].end();
       it++, t = (t + 1) % 5) {
    sum[p][t] += val[*it];
  }
  for (long long i = p + 1; i <= blo; i++) {
    long long tmp = sum[i][4];
    for (long long j = 4; j >= 1; j--) sum[i][j] = sum[i][j - 1];
    sum[i][0] = tmp;
  }
}
void dele(long long x) {
  long long p = (x - 1) / m + 1;
  long long s = 0;
  for (long long i = 1; i <= p - 1; i++) s = (s + second[i].size()) % 5;
  second[p].erase(x);
  memset(sum[p], 0, sizeof(sum[p]));
  long long t = (s + 1) % 5;
  for (set<long long>::iterator it = second[p].begin(); it != second[p].end();
       it++, t = (t + 1) % 5) {
    sum[p][t] += val[*it];
  }
  for (long long i = p + 1; i <= blo; i++) {
    long long tmp = sum[i][0];
    for (long long j = 0; j <= 3; j++) sum[i][j] = sum[i][j + 1];
    sum[i][4] = tmp;
  }
}
signed main() {
  myinit();
  for (long long i = 1; i <= n; i++) {
    if (ope[i].first == 1)
      add(ope[i].second);
    else if (ope[i].first == 2)
      dele(ope[i].second);
    else {
      long long s = 0;
      for (long long j = 1; j <= blo; j++) s += sum[j][3];
      cout << s << endl;
    }
  }
  return 0;
}
