#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
template <typename T>
void term(T a) {
  cout << a << "\n";
  exit(0);
}
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
long long int q, t, x, st, en, tot, cnt;
map<long long int, long long int> a;
inline void put(long long int x) {
  a[x]++;
  if (a.size() == 1)
    return;
  else if (a.size() == 2) {
    st = a.begin()->first;
    en = st;
    tot = st * a.begin()->second;
    cnt = a.begin()->second;
  } else {
    if (x < st) {
      st = x;
      tot += x;
      cnt++;
      auto it = a.find(en);
      while (it != a.begin()) {
        en = it->first;
        tot -= it->first * it->second;
        cnt -= it->second;
        if (static_cast<long double>(tot + it->first * it->second +
                                     a.rbegin()->first) /
                (cnt + 1 + it->second) >
            it->first)
          break;
        it--;
      }
    } else if (x <= en) {
      tot += x;
      cnt++;
    } else if (x != a.rbegin()->first)
      return;
    else {
      auto it = a.find(en);
      it++;
      while (it->first != a.rbegin()->first) {
        if (static_cast<long double>(tot + it->first * it->second +
                                     a.rbegin()->first) /
                (cnt + 1 + it->second) <=
            it->first)
          break;
        en = it->first;
        tot += it->first * it->second;
        cnt += it->second;
        it++;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> q;
  while (q--) {
    cin >> t;
    if (t == 1) {
      cin >> x;
      put(x);
    } else
      cout << setprecision(25)
           << a.rbegin()->first -
                  static_cast<long double>(tot + a.rbegin()->first) / (cnt + 1)
           << "\n";
  }
  return 0;
}
