#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define xx first
#define yy second
#define endl "\n"
#define lowbit(x) x & (-x)
#define int long long
#define ull unsigned long long
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define LF(x) fixed << setprecision(x)
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
const double eps = 1e-8;
int n;
int a[N];
void solve()
{
    int pos = 0, s = 0;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i], s += a[i];
    for (int i = 2; i <= n; i++)
    {
        if (a[i - 1] > a[i] && a[i + 1] > a[i])
        {
            pos = i;
            break;
        }
    }
    int pre = pos - 1;
    int suf = pos + 1;
    double ave = 1.0 * s / n;
    int sum = 0, cnt = 0;
    for (int i = 1; i < pre; i++)
    {
        if (a[i] > ave)
            cnt++, sum += a[i];
    }
    for (int i = suf + 1; i <= n; i++)
    {
        if (a[i] > ave)
            cnt++, sum += a[i];
    }
    for (int i = pre; i <= suf; i++)
    {
        sum += a[i];
        cnt++;
    }
    cout << LF(20);
    cout << 1.0 * sum / cnt << endl;
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}