#include <bits/stdc++.h>
using namespace std;
long long int sum[500005];
vector<long long int> v;
double fun(long long int i, long long int maxn) {
  return ((double)sum[i] + (double)maxn) / (double)(i + 2);
}
double tern(long long int low, long long int high, long long int maxn) {
  while (low < high) {
    long long int f = (2 * low + high) / 3;
    long long int g = (2 * high + low + 2) / 3;
    if (fun(f, maxn) < fun(g, maxn))
      high = g - 1;
    else if (fun(f, maxn) > fun(g, maxn))
      low = f + 1;
    else if (fun(f, maxn) == fun(g, maxn)) {
      low = f + 1;
      high = g - 1;
    }
  }
  if (low >= high) return maxn - fun(low, maxn);
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int ch, x;
    double ans;
    cin >> ch;
    if (ch == 1) {
      cin >> x;
      v.push_back(x);
      if (v.size() == 1)
        sum[0] = x;
      else
        sum[v.size() - 1] = sum[v.size() - 2] + x;
    }
    if (ch == 2) {
      if (v.size() == 1)
        ans = 0;
      else if (v.size() == 2)
        ans = ((double)v[1] - (double)(v[1] + v[0]) / (double)2);
      else {
        ans = tern(0, v.size() - 2, v[v.size() - 1]);
      }
      cout << setprecision(15) << ans << "\n";
    }
  }
}
