#include <bits/stdc++.h>
using namespace std;
static const int maxn = 2e5 + 5;
static const int maxb = 320;
struct Information {
  int s;
  int e;
  deque<long long> dq;
  long long sum[5];
  Information(int s = 0, int e = 0) : s(s), e(e) {
    dq.clear();
    memset(sum, 0, sizeof sum);
  }
};
long long arr[maxn];
Information block[maxb];
int total_block;
int get_block(int l) { return l / maxb; }
void create_block(int n) {
  int pre = 0;
  block[0].s = 0;
  block[0].dq.clear();
  memset(block[0].sum, 0, sizeof block[0].sum);
  for (int i = 0; i < n; i++) {
    int bl = get_block(i);
    if (pre < bl) {
      block[pre].e = i - 1;
      block[bl].s = i;
      block[bl].dq.clear();
      memset(block[bl].sum, 0, sizeof block[bl].sum);
      pre = bl;
    }
  }
  block[pre].e = n - 1;
}
void add(long long num) {
  int bl = -1;
  for (int b = 0; b <= total_block; b++) {
    if (block[b].dq.size() < maxb or block[b].dq.back() > num) {
      bl = b;
      break;
    }
  }
  assert(bl >= 0);
  if (block[bl].dq.size() < maxb) {
    deque<long long> dq;
    vector<long long> sum(5, 0);
    bool used = false;
    for (long long x : block[bl].dq) {
      if (used == false and x > num) {
        dq.push_back(num);
        used = true;
      }
      dq.push_back(x);
    }
    if (used == false) dq.push_back(num);
    for (int i = 0; i < dq.size(); i++) sum[i % 5] += dq[i];
    block[bl].dq = dq;
    for (int i = 0; i < 5; i++) block[bl].sum[i] = sum[i];
    return;
  }
  long long extra = block[bl].dq.back();
  block[bl].dq.pop_back();
  deque<long long> dq;
  vector<long long> sum(5, 0);
  bool used = false;
  for (long long x : block[bl].dq) {
    if (used == false and x > num) {
      dq.push_back(num);
      used = true;
    }
    dq.push_back(x);
  }
  if (used == false) dq.push_back(num);
  for (int i = 0; i < dq.size(); i++) sum[i % 5] += dq[i];
  block[bl].dq = dq;
  for (int i = 0; i < 5; i++) block[bl].sum[i] = sum[i];
  for (int b = bl + 1; b <= total_block; b++) {
    block[b].dq.push_front(extra);
    vector<long long> sum(5, 0);
    sum[1] = block[b].sum[0];
    sum[2] = block[b].sum[1];
    sum[3] = block[b].sum[2];
    sum[4] = block[b].sum[3];
    sum[0] = block[b].sum[4];
    sum[0] += extra;
    for (int i = 0; i < 5; i++) block[b].sum[i] = sum[i];
    if (block[b].dq.size() > maxb) {
      extra = block[b].dq.back();
      block[b].dq.pop_back();
      block[b].sum[0] -= extra;
    } else {
      break;
    }
  }
}
void del(long long num) {
  int bl = -1;
  for (int b = 0; b <= total_block; b++) {
    if (block[b].dq.back() >= num) {
      bl = b;
      break;
    }
  }
  assert(bl >= 0);
  if (block[bl + 1].dq.empty()) {
    deque<long long> dq;
    vector<long long> sum(5, 0);
    for (long long x : block[bl].dq) {
      if (x == num) continue;
      dq.push_back(x);
    }
    for (int i = 0; i < dq.size(); i++) sum[i % 5] += dq[i];
    block[bl].dq = dq;
    for (int i = 0; i < 5; i++) block[bl].sum[i] = sum[i];
    return;
  }
  long long extra = block[bl + 1].dq.front();
  block[bl + 1].dq.pop_front();
  block[bl + 1].sum[0] -= extra;
  deque<long long> dq;
  vector<long long> sum(5, 0);
  for (long long x : block[bl].dq) {
    if (x == num) continue;
    dq.push_back(x);
  }
  dq.push_back(extra);
  for (int i = 0; i < dq.size(); i++) sum[i % 5] += dq[i];
  block[bl].dq = dq;
  for (int i = 0; i < 5; i++) block[bl].sum[i] = sum[i];
  for (int b = bl + 1; b <= total_block; b++) {
    long long tmp = block[b].sum[0];
    block[b].sum[0] = block[b].sum[1];
    block[b].sum[1] = block[b].sum[2];
    block[b].sum[2] = block[b].sum[3];
    block[b].sum[3] = block[b].sum[4];
    block[b].sum[4] = tmp;
    if (block[b + 1].dq.empty()) break;
    extra = block[b + 1].dq.front();
    block[b + 1].dq.pop_front();
    block[b + 1].sum[0] -= extra;
    block[b].sum[4] += extra;
    block[b].dq.push_back(extra);
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  total_block = 312;
  create_block(100000);
  int q;
  cin >> q;
  while (q--) {
    string s;
    long long num;
    cin >> s;
    if (s == "add") {
      cin >> num;
      add(num);
    } else if (s == "del") {
      cin >> num;
      del(num);
    } else {
      long long sum = 0;
      for (int i = 0; i <= total_block; i++) {
        if (block[i].dq.size() == 0) break;
        sum += block[i].sum[2];
      }
      cout << sum << '\n';
    }
  }
}
