Bessie and the cows are playing with sequences and need your help. They start with a sequence, initially containing just the number 0, and perform n operations. Each operation is one of the following:

  1. Add the integer xi to the first ai elements of the sequence. 
  2. Append an integer ki to the end of the sequence. (And hence the size of the sequence increases by 1) 
  3. Remove the last element of the sequence. So, the size of the sequence decreases by one. Note, that this operation can only be done if there are at least two elements in the sequence. 



After each operation, the cows would like to know the average of all the numbers in the sequence. Help them!

Input

The first line contains a single integer n (1 ≤ n ≤ 2·105) — the number of operations. The next n lines describe the operations. Each line will start with an integer ti (1 ≤ ti ≤ 3), denoting the type of the operation (see above). If ti = 1, it will be followed by two integers ai, xi (|xi| ≤ 103; 1 ≤ ai). If ti = 2, it will be followed by a single integer ki (|ki| ≤ 103). If ti = 3, it will not be followed by anything.

It is guaranteed that all operations are correct (don't touch nonexistent elements) and that there will always be at least one element in the sequence.

Output

Output n lines each containing the average of the numbers in the sequence after the corresponding operation.

The answer will be considered correct if its absolute or relative error doesn't exceed 10 - 6.

Examples

Input

5
2 1
3
2 3
2 1
3


Output

0.500000
0.000000
1.500000
1.333333
1.500000


Input

6
2 1
1 2 20
2 2
1 2 -3
3
3


Output

0.500000
20.500000
14.333333
12.333333
17.500000
17.000000

Note

In the second sample, the sequence becomes <image>
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T BigMod(T b, T p, T m) {
  if (p == 0) return 1;
  if (p % 2 == 0) {
    T s = BigMod(b, p / 2, m);
    return ((s % m) * (s % m)) % m;
  }
  return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
T ModInv(T b, T m) {
  return BigMod(b, m - 2, m);
}
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
template <typename T>
T POW(T B, T printf) {
  if (printf == 0) return 1;
  if (printf & 1)
    return B * POW(B, printf - 1);
  else
    return (POW(B, printf / 2) * POW(B, printf / 2));
}
template <typename T>
T Bigmod(T b, T p, T m) {
  if (p == 0)
    return 1;
  else if (!(p & 1))
    return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m;
  else
    return ((b % m) * Bigmod(b, p - 1, m)) % m;
}
template <typename T>
T Dis(T x1, T y1, T x2, T y2) {
  return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2));
}
template <typename T>
T Angle(T x1, T y1, T x2, T y2) {
  return atan(double(y1 - y2) / double(x1 - x2));
}
template <typename T>
T DIFF(T a, T b) {
  T d = a - b;
  if (d < 0)
    return -d;
  else
    return d;
}
template <typename T>
T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
template <typename T>
T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  if (a < 0) return lcm(-a, b);
  if (b < 0) return lcm(a, -b);
  return a * (b / gcd(a, b));
}
template <typename T>
T euclide(T a, T b, T &x, T &y) {
  if (a < 0) {
    T d = euclide(-a, b, x, y);
    x = -x;
    return d;
  }
  if (b < 0) {
    T d = euclide(a, -b, x, y);
    y = -y;
    return d;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    T d = euclide(b, a % b, x, y);
    T t = x;
    x = y;
    y = t - (a / b) * y;
    return d;
  }
}
template <typename T>
void ia(T a[], int n) {
  for (int i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void pa(T a[], int n) {
  for (int i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
template <typename T>
long long int isLeft(T a, T b, T c) {
  return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y);
}
int Set(int N, int pos) { return N = N | (1 << pos); }
int Reset(int N, int pos) { return N = N & ~(1 << pos); }
bool Check(int N, int pos) { return (bool)(N & (1 << pos)); }
template <class T, class first>
inline T togglebit(T a, first i) {
  T t = 1;
  return (a ^ (t << i));
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int cdigittoint(char ch) { return ch - '0'; }
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
bool isConst(char ch) {
  if (isalpha(ch) && !isVowel(ch)) return true;
  return false;
}
double DEG(double x) { return (180.0 * x) / (2.0 * acos(0.0)); }
double RAD(double x) { return (x * (double)2.0 * acos(0.0)) / (180.0); }
long long int Tree[4 * 200007];
long long int Lazy[4 * 200007];
void Push(int idx, int l, int r, long long int x) {
  Lazy[idx] += x;
  Tree[idx] += x * (r - l + 1);
}
void Update(int idx, int l, int r, int s, int e, long long int x) {
  if (l == s && r == e) {
    Push(idx, l, r, x);
    return;
  }
  if (Lazy[idx]) {
    Push((idx << 1), l, ((l + r) >> 1), Lazy[idx]);
    Push(((idx << 1) | 1), ((l + r) >> 1) + 1, r, Lazy[idx]);
    Lazy[idx] = 0;
  }
  if (e <= ((l + r) >> 1))
    Update((idx << 1), l, ((l + r) >> 1), s, e, x);
  else if (s > ((l + r) >> 1))
    Update(((idx << 1) | 1), ((l + r) >> 1) + 1, r, s, e, x);
  else {
    Update((idx << 1), l, ((l + r) >> 1), s, ((l + r) >> 1), x);
    Update(((idx << 1) | 1), ((l + r) >> 1) + 1, r, ((l + r) >> 1) + 1, e, x);
  }
  Tree[idx] = Tree[(idx << 1)] + Tree[((idx << 1) | 1)];
}
void UpdatePos(int idx, int l, int r, int p, int v) {
  if (l == r) {
    Tree[idx] = v;
    Lazy[idx] = 0;
    return;
  }
  if (Lazy[idx]) {
    Push((idx << 1), l, ((l + r) >> 1), Lazy[idx]);
    Push(((idx << 1) | 1), ((l + r) >> 1) + 1, r, Lazy[idx]);
    Lazy[idx] = 0;
  }
  if (p <= ((l + r) >> 1))
    UpdatePos((idx << 1), l, ((l + r) >> 1), p, v);
  else
    UpdatePos(((idx << 1) | 1), ((l + r) >> 1) + 1, r, p, v);
  Tree[idx] = Tree[(idx << 1)] + Tree[((idx << 1) | 1)];
}
int main() {
  int(q);
  scanf("%d", &q);
  int sz = 1;
  int lim = 200001;
  while (q--) {
    int(cs);
    scanf("%d", &cs);
    if (cs == 1) {
      int x, y;
      scanf("%d%d", &x, &y);
      Update(1, 1, lim, 1, x, y);
    } else {
      int v = 0;
      if (cs == 2) {
        scanf("%d", &v);
        sz++;
      }
      UpdatePos(1, 1, lim, sz, v);
      if (cs == 3) sz--;
    }
    printf("%.10lf\n", 1.0 * Tree[1] / sz);
  }
  return 0;
}
