#include <iostream>
#include <vector>

using namespace std;
using i64 = long long;

void solve() {
	int n;
	cin >> n;
	vector<i64> a(n);
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	double ans = 0;
	int cur1 = 0, cur2 = 1, sums = 0;
	sums += a[0];
	bool flag = (a[1] >= a[0]);
	while(cur2 != n) {
		while(cur2 != n && ((a[cur2] < a[cur2 - 1]) ^ flag)) {
			sums += a[cur2];
			cur2++;
		}
		flag ^= 1;
		if(flag == 0) {
			ans = max(double(sums) / (cur2 - cur1), ans);
			cur1 = cur2 - 1;
			sums = 0;
		}
 	}
 	cout << ans << endl;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}