#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <random>
#include <cassert>
// #include <bits/stdc++.h>

using namespace std;
#define F first
#define S second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef pair<ll,ll> pll;
typedef vector<string> vs;
typedef vector<pll> vpl;
typedef vector<int> vi;

ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());

const int maxn = 3*100000 + 10;

// const int inf = 1000000000;
// const ll inf = 1000000000000000000LL;

// const ll mod = 998244353;
// const ll mod = 1000000007; // 10^9 + 7

int n;

int v[maxn];

double tryPrefix(int idMin)
{
    double s = 0;

    for(int i = 1 ; i < idMin ; i++)
        s += v[i];

    double ans = 0;

    for(int i = idMin ; i <= n ; i++)
        s += v[i], ans = max( ans , s/i );

    return ans;
}

void solve(int testcase)
{
    cin >> n;

    for(int i = 1 ; i <= n ; i++)
        cin >> v[i];

    int idMin = 1;

    for(int i = 2 ; i <= n ; i++)
        if( v[i] < v[idMin] ) idMin = i;

    double ans = tryPrefix( idMin );

    reverse( v + 1 , v + n + 1 );
    idMin = n - idMin + 1;

    ans = max( ans , tryPrefix(idMin) );

    cout << fixed << setprecision(15) << ans << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);  
    cin.tie(NULL);

    int t = 1;
    cin >> t;

    for(int testcase = 1 ; testcase <= t ; testcase++)
        solve( testcase );
}