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;
namespace Fastio {
struct Reader {
  char endch;
  Reader() { endch = '\0'; }
  Reader& operator>>(char& ch) {
    ch = getchar();
    while (ch == ' ' || ch == '\r' || ch == '\n' || ch == '\t') ch = getchar();
    return *this;
  }
  template <typename Int>
  Reader& operator>>(Int& d) {
    bool flag = 0;
    endch = getchar();
    while ((!isdigit(endch)) && endch != '-' && endch != EOF) endch = getchar();
    if (endch == '-') flag = 1, endch = getchar();
    d = endch & 15;
    while (isdigit(endch = getchar())) d = (d << 3) + (d << 1) + (endch & 15);
    if (flag) d = -d;
    return *this;
  }
  template <typename T>
  inline T get() {
    T Val;
    (*this) >> Val;
    return Val;
  }
} read;
struct Writer {
  Writer& operator<<(const char* ch) {
    while (*ch) putchar(*(ch++));
    return *this;
  }
  Writer& operator<<(const char ch) {
    putchar(ch);
    return *this;
  }
  template <typename Int>
  Writer& operator<<(Int x) {
    static char buffer[33];
    static int top = 0;
    if (!x) {
      putchar('0');
      return *this;
    }
    if (x < 0) putchar('-'), x = -x;
    while (x) {
      buffer[++top] = '0' | (x % 10);
      x /= 10;
    }
    while (top) putchar(buffer[top--]);
    return *this;
  }
} write;
}  // namespace Fastio
using namespace Fastio;
char get_op() {
  static char buffer[4];
  scanf("%s", buffer);
  return buffer[0];
}
const int N = 1e5 + 7;
struct segtree_node {
  int ls, rs;
  int siz;
  long long val[5];
  void clear() {
    ls = rs = siz = 0;
    memset(val, 0, sizeof(val));
  }
} tr[N << 5];
void pushup(int u) {
  tr[u].siz = tr[tr[u].ls].siz + tr[tr[u].rs].siz;
  int shift = 5 - tr[tr[u].ls].siz % 5;
  for (int i = 0; i < 5; ++i)
    tr[u].val[i] = tr[tr[u].ls].val[i] + tr[tr[u].rs].val[(i + shift) % 5];
}
class MemoryPool {
 private:
  int pool_stack[N << 3], stack_top, unused_node;

 public:
  MemoryPool() : stack_top(0), unused_node(0) {}
  void recycle(int node) {
    pool_stack[++stack_top] = node;
    tr[node].clear();
  }
  int get() { return stack_top ? pool_stack[stack_top--] : ++unused_node; }
} pool;
class segment_tree {
 private:
  int root;
  void BASE_insert_or_modify(int& u, int l, int r, int pos) {
    if (!u) u = pool.get();
    if (l == r) {
      tr[u].siz = 1;
      tr[u].val[1] = pos;
      return;
    }
    int mid = (l + r) >> 1;
    if (pos <= mid)
      BASE_insert_or_modify(tr[u].ls, l, mid, pos);
    else
      BASE_insert_or_modify(tr[u].rs, mid + 1, r, pos);
    pushup(u);
  }
  void BASE_erase(int& u, int l, int r, int pos) {
    if (l == r) {
      pool.recycle(u);
      u = 0;
      return;
    }
    int mid = (l + r) >> 1;
    if (pos <= mid)
      BASE_erase(tr[u].ls, l, mid, pos);
    else
      BASE_erase(tr[u].rs, mid + 1, r, pos);
    if (!tr[u].ls && !tr[u].rs) {
      pool.recycle(u);
      u = 0;
    } else
      pushup(u);
  }

 public:
  segment_tree() : root(0) {}
  void insert(int pos) { BASE_insert_or_modify(root, 1, 1e9, pos); }
  void modify(int pos) { BASE_insert_or_modify(root, 1, 1e9, pos); }
  void erase(int pos) { BASE_erase(root, 1, 1e9, pos); }
  long long query_sum() { return tr[root].val[3]; }
} segt;
int n;
signed main() {
  read >> n;
  while (n--) {
    switch (get_op()) {
      case 'a':
        segt.insert(read.get<int>());
        break;
      case 'd':
        segt.erase(read.get<int>());
        break;
      case 's':
        write << segt.query_sum() << '\n';
        break;
    }
  }
  return 0;
}