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

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

bool chk (db t) {
    db l1 = t * v[0], l2 = t * v[1];
    if (l1 > (p[0] + n) || l1 > (2 * n - p[0])) {
        return true;
    }
    if (l2 > (p[1] + n) || l2 > (2 * n - p[1])) {
        return true;
    }
    if (l1 > n - p[0] && l2 > p[1]) {
        return true;
    }
    if (l1 < p[0] || l2 < (n - p[1])) {
        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);
    if (out1 + out2 > (p[1] - p[0])) {
        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;
        while (R - L > eps) {
            db mid = (L + R) / 2.0;
            if (chk (mid)) R = mid;
            else L = mid;
        }
        printf ("%.9Lf\n", L);
    }
    return 0;
}