#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 9;
long double eps = 1e-12;
long long int dx[] = {0, 0, 1, -1};
long long int dy[] = {1, -1, 0, 0};
long long int m = 0, n, res = 0, k, h;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int x, long long int y) {
  return (x * y) / gcd(x, y);
}
string s2, ch = "", s, s1 = "", t;
vector<pair<string, long long int> > vm;
vector<pair<pair<long long int, long long int>, long long int> > vvvl, vvvr;
vector<pair<long long int, long long int> > vv, vv2;
vector<long long int> v[200005], ans;
long long int a[500005], b[500005];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long int i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, idx = 0, ok = 0,
                l = 0, r = 0, negatif = 0, positif = 0, l1, r1, g = 0, d;
  set<long long int>::iterator it;
  cin >> q;
  res = 0;
  n = 1;
  b[n] = 0;
  b[1] = 0;
  while (q--) {
    long long int op;
    cin >> op;
    if (op == 1) {
      cin >> k >> x;
      res += k * x;
      a[k] += x;
    } else if (op == 2) {
      cin >> k;
      n++;
      b[n] = k;
      a[n] = 0;
      res += k;
    } else if (op == 3) {
      res -= (a[n] + b[n]);
      a[n - 1] += a[n];
      a[n] = 0;
      b[n] = 0;
      n--;
    }
    long double ans;
    if (n)
      ans = (res) / (long double)(n);
    else
      ans = 0;
    cout << fixed << setprecision(9) << ans << '\n';
  }
  return 0;
}
