#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int nax = 1000000 + 10;
long long int n, arr[nax];
double f(long long int r, long long int n) {
  double ans = (double)(1.0 * arr[r] + arr[n] - arr[n - 1]);
  return 1.0 * (arr[n] - arr[n - 1]) - ans / ((r + 1) * 1.0);
}
void solve(long long int n) {
  long long int maxi = arr[n] - arr[n - 1];
  long long int l = 1;
  long long int r = n - 1;
  while (r - l > 1) {
    long long int mid = (r + l) / 2;
    if (f(mid, n) > f(mid + 1, n)) {
      r = mid;
    } else
      l = mid + 1;
  }
  cout << fixed << setprecision(10) << max(f(l, n), f(r, n)) << "\n";
}
int main() {
  long long int n = 0;
  long long int ptr = 0;
  long long int q;
  cin >> q;
  while (q--) {
    int type;
    cin >> type;
    if (type == 2) {
      solve(n);
      continue;
    }
    n++;
    long long int num;
    cin >> num;
    arr[n] = num;
    arr[n] += arr[n - 1];
  }
  return 0;
}
