#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
#define ull unsigned long long
#define lowbit(x) x&-x
#define lc p<<1
#define rc p<<1|1
#define PII pair<int,int>
#define vi vector<int>
using namespace std;
const int mod = 998244353;
const int N = 2e5+10;
void solve()
{
    int n;
    cin >> n;
    vi a(n);
    for(auto &i:a)cin >> i;
    long double sum = 0;
    int x = 0;
    for(int i = 0;i<n;i++)
    {
        if(a[i]<a[i-1] && a[i]<a[i+1]) {
            x = i;
            break;
        }
    }
    long double ans = 0;
    sum = a[x] + a[x+1] + a[x-1];
    ans = sum/3;
//    cout<<ans<<'\n';
    int i = x-2,j = x+2;
//    cout<<x<<'\n';
    int cnt = 3;
    while(i>=0 && j<n)
    {
        ++cnt;
        if(a[i]>a[j])
        {
            sum+=a[i];
            i--;
            ans = max(ans,sum/cnt);
        }
        else
        {
            sum+=a[j];
            j++;
            ans = max(ans,sum/cnt);
        }
//        cout<<ans<<'\n';
    }
    while(i>=0)
    {
        ++cnt;
        sum+=a[i];
        i--;
        ans = max(ans,sum/cnt);
    }
    while(j<n)
    {
        ++cnt;
        sum+=a[j];
        j++;
        ans = max(ans,sum/cnt);
    }
    cout<<ans<<'\n';
}
signed main()
{
    cout<<fixed<<setprecision(20);
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    int _ = 1;
    cin >> _;
    while(_--)solve();
}