#include <bits/stdc++.h>
#define LL long long
#define db long double
using namespace std;

int T;
constexpr db eps = 1e-15;
db n, p[2], v[2];

bool chk (db t) {
    db l1 = t * v[0], l2 = t * v[1];
    if (l1 - (p[0] + n) > eps || l1 - (2 * n - p[0]) > eps) {
        return true;
    }
    if (l2 - (p[1] + n) > eps || l2 - (2 * n - p[1]) > eps) {
        return true;
    }
    if (l1 - p[0] < eps || l2 - (n - p[1]) < eps) {
        return false;
    }
    db out1 = std::max(l1 - 2 * p[0], (l1 - p[0]) / 2);
    db out2 = std::max(l2 - 2 * (n - p[1]), (l2 - (n - p[1])) / 2);
    out1 = std::max((db)0.0, out1);
    out2 = std::max((db)0.0, out2);
    if (out1 + out2 - (p[1] - p[0]) > eps) {
        return true;
    }
    return false;
}

int main() {
    // freopen("in", "r", stdin);
    scanf ("%d", &T);
    while (T--) {
        scanf ("%Lf%Lf%Lf%Lf%Lf", &n, &p[0], &v[0], &p[1], &v[1]);
        if (p[0] > p[1]) swap (p[0], p[1]), swap (v[0], v[1]);
        db L = 0, R = 1e9;
        int cnt = 100;
        while (cnt--) {
            db mid = (L + R) / 2.0;
            if (chk (mid)) R = mid;
            else L = mid;
        }
        printf ("%.9Lf\n", L);
        /*
        db ans = min (calc (0, 0, n), calc (1, 0, n));
        //printf ("%.15Lf\n", ((db) 1000) / ((db)0.001));
        //printf ("%.15Lf\n", ans);
        //return 0;
        //ans = min (ans, max (0, 0, p[1]))
        //cout << n << endl;
        //cout << calc (0, 0, n) << endl;
        db L = p[0], R = p[1];
        int cnt = 300;
        while (cnt--) {
            db fm = (R - L) / ((db) 3.0), m1 = L + fm, m2 = R - fm;
            db a1 = max (calc (0, 0, m1), calc (1, m1, n));
            db a2 = max (calc (0, 0, m2), calc (1, m2, n));
            ans = min (ans, a1);
            ans = min (ans, a2);
            if (a1 < a2) R = m2;
            else L = m1;
        }
        ans = min (ans, max (calc (0, 0, L), calc (1, L, n)));
        printf ("%.15Lf\n", ans);
        */
    }
    return 0;
}