#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
const int mod = 1000000007;
vector<long long int> arr;
int main() {
  long long int sum = 0, typ, q, n = 0, v, i, j, k;
  double ans = 0.0, res;
  scanf("%lld", &q);
  arr.push_back(0);
  while (q--) {
    scanf("%lld", &typ);
    if (typ == 1) {
      scanf("%lld", &v);
      sum += v;
      if (arr.size() == 1) {
        arr.push_back(sum);
        ans = 0.0;
        continue;
      }
      int low = 1, hi = arr.size() - 1;
      while (low < hi) {
        int a = (hi + 2 * low) / 3;
        int b = (2 * hi + low) / 3;
        if (b == a) b++;
        double v1 = (double)(arr[a] + v) / (a + 1);
        double v2 = (double)(arr[b] + v) / (b + 1);
        if (v1 > v2) {
          low = a + 1;
        } else {
          hi = b - 1;
        }
      }
      arr.push_back(sum);
      res = (double)(v + arr[low]) / (low + 1);
      res = (double)v - res;
      ans = max(ans, res);
    } else {
      printf("%.9f\n", ans);
    }
  }
  return 0;
}
