Problem: In one well-known algorithm of finding the k-th order statistics we should divide all elements into groups of five consecutive elements and find the median of each five. A median is called the middle element of a sorted array (it's the third largest element for a group of five). To increase the algorithm's performance speed on a modern video card, you should be able to find a sum of medians in each five of the array.

A sum of medians of a sorted k-element set S = {a1, a2, ..., ak}, where a1 < a2 < a3 < ... < ak, will be understood by as 

<image>

The <image> operator stands for taking the remainder, that is <image> stands for the remainder of dividing x by y.

To organize exercise testing quickly calculating the sum of medians for a changing set was needed.

Input

The first line contains number n (1 ≤ n ≤ 105), the number of operations performed.

Then each of n lines contains the description of one of the three operations: 

  * add x — add the element x to the set; 
  * del x — delete the element x from the set; 
  * sum — find the sum of medians of the set. 



For any add x operation it is true that the element x is not included in the set directly before the operation.

For any del x operation it is true that the element x is included in the set directly before the operation.

All the numbers in the input are positive integers, not exceeding 109.

Output

For each operation sum print on the single line the sum of medians of the current set. If the set is empty, print 0.

Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams (also you may use the %I64d specificator).

Examples

Input

6
add 4
add 5
add 1
add 2
add 3
sum


Output

3


Input

14
add 1
add 7
add 2
add 5
sum
add 6
add 8
add 9
add 3
add 4
add 10
sum
del 1
sum


Output

5
11
13

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const long long LINF = 2e16;
const int magic = 348;
const int MOD = 998244353;
const double eps = 1e-10;
const double pi = acos(-1);
inline int getint() {
  bool f;
  char ch;
  int res;
  while (!isdigit(ch = getchar()) && ch != '-') {
  }
  if (ch == '-')
    f = false, res = 0;
  else
    f = true, res = ch - '0';
  while (isdigit(ch = getchar())) res = res * 10 + ch - '0';
  return f ? res : -res;
}
const int MAXN = 1e5;
int root[10];
pair<int, int> tmp[10];
namespace Treap {
struct node {
  int left, right, val, priority;
  long long sum;
  int sz;
} tree[MAXN * 2];
int tot = 0;
inline void pushup(int cur) {
  tree[cur].sum =
      tree[tree[cur].left].sum + tree[tree[cur].right].sum + tree[cur].val;
  tree[cur].sz = tree[tree[cur].left].sz + tree[tree[cur].right].sz + 1;
}
inline int Create(int left, int right, int val, int priority) {
  ++tot;
  tree[tot].left = left;
  tree[tot].right = right;
  tree[tot].val = val;
  tree[tot].priority = priority;
  pushup(tot);
  return tot;
}
inline pair<int, int> split(int root, int val) {
  if (!root) return make_pair(0, 0);
  if (tree[root].val < val) {
    pair<int, int> splitted = split(tree[root].right, val);
    tree[root].right = splitted.first;
    pushup(root);
    return make_pair(root, splitted.second);
  } else {
    pair<int, int> splitted = split(tree[root].left, val);
    tree[root].left = splitted.second;
    pushup(root);
    return make_pair(splitted.first, root);
  }
}
inline pair<int, int> split2(int root, int k) {
  if (!root) return make_pair(0, 0);
  int leftsz = tree[tree[root].left].sz + 1;
  if (k >= leftsz) {
    pair<int, int> splitted = split2(tree[root].right, k - leftsz);
    tree[root].right = splitted.first;
    pushup(root);
    return make_pair(root, splitted.second);
  } else {
    pair<int, int> splitted = split2(tree[root].left, k);
    tree[root].left = splitted.second;
    pushup(root);
    return make_pair(splitted.first, root);
  }
}
inline int merge(int root1, int root2) {
  if (!root1 || !root2) return root1 + root2;
  if (tree[root1].priority <= tree[root2].priority) {
    tree[root1].right = merge(tree[root1].right, root2);
    pushup(root1);
    return root1;
  } else {
    tree[root2].left = merge(root1, tree[root2].left);
    pushup(root2);
    return root2;
  }
}
inline bool find(int root, int first) {
  if (!root) return false;
  if (tree[root].val == first) return true;
  if (first < tree[root].val)
    return find(tree[root].left, first);
  else
    return find(tree[root].right, first);
}
}  // namespace Treap
int main() {
  int first, i, pos, q = getint();
  char op[5];
  while (q--) {
    scanf("%s", op + 1);
    if (op[1] == 'a') {
      first = getint();
      for (i = 0; i <= 4; i++) tmp[i] = Treap::split(root[i], first);
      pos = 1;
      for (i = 0; i <= 4; i++) pos += Treap::tree[tmp[i].first].sz;
      pos %= 5;
      tmp[pos].first =
          Treap::merge(tmp[pos].first, Treap::Create(0, 0, first, rand()));
      for (i = 0; i <= 4; i++)
        root[(i + 1) % 5] = Treap::merge(tmp[(i + 1) % 5].first, tmp[i].second);
    }
    if (op[1] == 'd') {
      first = getint();
      for (i = 0; i <= 4; i++)
        if (Treap::find(root[i], first)) {
          pos = i;
          break;
        }
      for (i = 0; i <= 4; i++) tmp[i] = Treap::split(root[i], first);
      tmp[pos].second = Treap::split2(tmp[pos].second, 1).second;
      for (i = 0; i <= 4; i++)
        root[i] = Treap::merge(tmp[i].first, tmp[(i + 1) % 5].second);
    }
    if (op[1] == 's') printf("%lld\n", Treap::tree[root[3]].sum);
  }
  return 0;
}