#include <bits/stdc++.h>
const double pi = acos(-1.0);
const double eps = 1e-9;
using namespace std;
const int N = 2e5 + 10;
int n;
int type[N], oldA[N];
long long t[4 * N][5], cnt[4 * N];
void update(int v, int tl, int tr, int pos, long long val) {
  if (tl == tr) {
    cnt[v] ^= 1;
    t[v][0] = val;
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm)
      update(v * 2, tl, tm, pos, val);
    else
      update(v * 2 + 1, tm + 1, tr, pos, val);
    cnt[v] = cnt[v * 2] + cnt[v * 2 + 1];
    for (int mod = 0; mod < 5; mod++) {
      int cntLeft = cnt[v * 2] % 5;
      int oc = ((5 - cntLeft) % 5 + mod) % 5;
      t[v][mod] = t[v * 2][mod] + t[v * 2 + 1][oc];
    }
  }
}
void solve() {
  cin >> n;
  set<int> a;
  for (int i = 0; i < n; i++) {
    string s;
    int x;
    cin >> s;
    if (s[0] == 'a') {
      type[i] = 0;
    } else if (s[0] == 'd') {
      type[i] = 1;
    } else {
      type[i] = 2;
    }
    if (type[i] != 2) {
      cin >> x;
      a.insert(x);
      oldA[i] = x;
    }
  }
  map<int, int> where;
  int len = a.size();
  for (int i = 0; i < len; i++) {
    int x = *a.begin();
    where[x] = i;
    a.erase(x);
  }
  for (int i = 0; i < n; i++) {
    if (type[i] == 2) {
      cout << t[1][2] << "\n";
      continue;
    }
    long long add = 0;
    if (!type[i]) {
      add = oldA[i];
    }
    update(1, 0, len - 1, where[oldA[i]], add);
  }
}
int main() {
  ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
  cout.setf(ios::fixed), cout.precision(3);
  int step = 1;
  for (int i = 0; i < step; i++) {
    solve();
  }
}
