#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 9;
struct Node {
  Node() : cnt(0) {
    for (int i = 0; i < 5; ++i) {
      sum[i] = 0;
    }
  }
  int cnt;
  long long sum[5];
} tree[(MAX << 2)];
int n, idx;
bool freq[MAX];
vector<pair<int, int> > q;
vector<int> v;
Node mergeNodes(const Node& a, const Node& b) {
  Node ret;
  ret.cnt = a.cnt + b.cnt;
  int offset = (5 - a.cnt % 5) % 5;
  for (int i = 0; i < 5; ++i) {
    ret.sum[i] = a.sum[i] + b.sum[(i + offset) % 5];
  }
  return ret;
}
void upd(int low, int high, int pos) {
  if (low == high) {
    if (freq[low]) {
      tree[pos].cnt = 1;
      tree[pos].sum[0] = v[low];
    } else {
      tree[pos].cnt = 0;
      tree[pos].sum[0] = 0;
    }
    return;
  }
  int mid = ((low + high) >> 1);
  if (idx <= mid) {
    upd(low, mid, (pos << 1));
  } else {
    upd(mid + 1, high, (pos << 1 | 1));
  }
  tree[pos] = mergeNodes(tree[(pos << 1)], tree[(pos << 1 | 1)]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    if (s[0] == 's') {
      q.push_back({2, -1});
    } else {
      int x;
      cin >> x;
      int type = (s[0] == 'a' ? 0 : 1);
      q.push_back({type, x});
      v.push_back(x);
    }
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  v.insert(v.begin(), -1);
  for (int i = 0; i < n; ++i) {
    int type = q[i].first;
    if (type == 2) {
      cout << tree[1].sum[2] << "\n";
    } else if (type == 0) {
      int x = q[i].second;
      idx = lower_bound(v.begin(), v.end(), x) - v.begin();
      freq[idx] = 1;
      upd(1, v.size(), 1);
    } else {
      int x = q[i].second;
      idx = lower_bound(v.begin(), v.end(), x) - v.begin();
      freq[idx] = 0;
      upd(1, v.size(), 1);
    }
  }
  return 0;
}
