H - Maximize!

You are given a multiset S consisting of positive integers (initially empty). There are two kind of queries:

1. Add a positive integer to S, the newly added integer is not less than any number in it.
2. Find a subset s of the set S such that the value  is maximum possible. Here max(s) means maximum value of elements in s,  — the average value of numbers in s. Output this maximum possible value of .

Input

The first line contains a single integer Q (1 ≤ Q ≤ 5·10⁵) — the number of queries.

Each of the next Q lines contains a description of query. For queries of type 1 two integers 1 and x are given, where x (1 ≤ x ≤ 10⁹) is a number that you should add to S. It's guaranteed that x is not less than any number in S. For queries of type 2, a single integer 2 is given.

It's guaranteed that the first query has type 1, i. e. S is not empty when a query of type 2 comes.

Output

Output the answer for each query of the second type in the order these queries are given in input. Each number should be printed in separate line.

Your answer is considered correct, if each of your answers has absolute or relative error not greater than 10^- 6.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if .

Example

Input

6
1 3
2
1 4
2
1 8
2

Output

0.0000000000
0.5000000000
3.0000000000

Input

4
1 1
1 4
1 5
2

Output

2.0000000000

首先是考虑选取一个最大值，然后选取较小值让平均数减小！

假如不是开始选取最大值，总可以找到一个较大数替换，得到一个更优解！

然后是记忆化计算前缀和sum，每个算出来的sum都可以后面的值继续用，因为可以这样考虑，比如当前最大值是max1，然后又插入了个比它大的max2，前面所求得的子集对max1而言都可以使平均数减小，那么max2更是如此！

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
#define inf int(0x3f3f3f3f)
#define mod int(1e9+7)
#define pi acos(-1)

int n;
double maxn;
double sum,ave;
int a[500005];

int main()
{
	while(~scanf("%d",&n))
	{
		int pos=0;
		int sta=0;
		sum=0;
		ave=0;
		for(int i=1;i<=n;i++)
		{
			int c,b;
			scanf("%d",&c);
			if(c==1)
			{
				scanf("%d",&b);
				maxn=b;
				a[pos++]=b;
			}
			else
			{
				for(int j=sta;j<pos-1;j++)
				{
					double ans=(sum+maxn)/(sta+1);
						if(a[j]<=ans)
						{
							sum+=a[j];
							sta++;
						}
					    else
						{
							break;
						}
				}
				printf("%.8f\n",(maxn-(maxn+sum)/(sta+1)));
			}
		}
	}
	return 0;
}