#include <bits/stdc++.h>
const bool DEBUG = false;
using namespace std;
const long long maxn = 5e5 + 5;
const long long INF = 4e18;
const long long M = 1e9 + 7;
const int lg = 21;
int n, q, x, y;
long double ans, dp[maxn], a[maxn];
long double f(int n) {
  long double x = a[n - 1];
  int low = -1, high = n - 1, mid = 0;
  while (high - low > 1) {
    long double z = 0;
    mid = high + low >> 1;
    if (mid == 0)
      z = 0;
    else
      z = dp[mid - 1];
    if ((z + x) / (mid + 1) > a[mid])
      low = mid;
    else
      high = mid;
  }
  if (low == -1) return x;
  return (x + dp[low]) / ((long double)low + 2);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> q;
  cin >> x >> y;
  a[0] = y;
  dp[0] = y;
  n = 1;
  for (int i = 1; i < q; i++) {
    long double x;
    int tp;
    cin >> tp;
    if (tp == 2) {
      if (n == 1) {
        cout << fixed << setprecision(10) << ans << endl;
        ans = 0;
        continue;
      }
      ans = max(ans, a[n - 1] - f(n));
      cout << fixed << setprecision(10) << ans << endl;
    } else {
      cin >> x;
      a[n] = x;
      dp[n] = dp[n - 1] + a[n];
      n++;
    }
  }
  return 0;
}
