#include <bits/stdc++.h>
#include <iomanip>
#include <vector>
using namespace std;
typedef long long ll;
// #define int long long
typedef pair<int, int> P;
const int MAX_N = 1e5 + 5;
const int mod = 1e9 + 7;
int a[MAX_N];

void solve()
{
    int n;
    cin >> n;
    vector<P> v;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    int sum = 0;
    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        sum += a[i];
        cnt++;
        if (i + 1 < n && a[i + 1] > a[i])
        {
            for (int j = i + 1; j < n; j++)
            {
                // cout << j << ' ' << i + 1 << endl;
                // 8 2 7 10
                sum += a[j];
                cnt++;
                // cout << "j+1: " << j + 1 << ' ' << "n:" << n << endl;
                if ((j + 1 < n && a[j + 1] < a[j])||j==n-1)
                {
                    v.push_back({sum, cnt});
                    sum = 0;
                    cnt = 0;
                    i = j;
                    break;
                }
            }
        }
    }
    sort(v.rbegin(), v.rend());
    // if (!v.empty())
    cout << fixed << setprecision(10) << static_cast<double>(v[0].first) / v[0].second << endl;
    // else
    // cout << "为空" << endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

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