#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const double eps = 1e-7;
const double INF = 1e10;
double n, p1, v1, p2, v2;

int main() {
	int t; scanf("%d", &t);
	for (int u = 1; u <= t; u++) {
		scanf("%lf %lf %lf %lf %lf", &n, &p1, &v1, &p2, &v2);
		if (p1 > p2) {
			swap(p1, p2);
			swap(v1, v2);
		}
		double l = 0, r = INF;
		while (r - l > eps) {
			double mid = (r + l) / 2;
			double S1 = mid * v1, S2 = mid * v2;
			bool flag = false;
			// LL
			if (S1 < p1 && S2 >= p2 + n) flag = true;
			if (p1 <= S1 && S1 < 2 * p1 && S2 >= p2 - p1 + n - p1) flag = true;
			if (2 * p1 <= S1 && S1 < p1 + p2 && S1 + S2 >= n + p2 + 2 * p1 - S1) flag = true;
			// RR
			if (S2 < n - p2 && S1 >= 2 * n - p1) flag = true;
			if (n - p2 <= S2 && S2 < 2 * (n - p2) && S1 >= p2 - p1 + p2) flag = true;
			if (2 * (n - p2) <= S2 && S2 < 2 * n - p1 - p2 && S1 + S2 >= n + n - p2 - p2 - p1 - S2 + 2 * n) flag = true;
			// LR
			if (S1 >= n + p1) flag = true;
			if (S1 >= p1 + p2 && S1 < n + p1 && S2 >= n - p2) flag = true;
			if (S1 >= 2 * p1 && S1 < p1 + p2 && S1 + S2 >= 2 * n + p1 - p2) flag = true;
			if (p1 <= S1 && S1 < 2 * p1 && S2 >= 2 * n - p1 - p2) flag = true;
			if (S1 < p1 && S2 >= 2 * n - p2) flag = true;
			// RL
			if (S2 <= p2 && S1 >= 2 * n - p1) flag = true;
			if (p2 < S2 && S2 <= p2 + n && S1 >= n - p1) flag = true;
			if (S2 >= p2 + n) flag = true;
			if (S1 >= p1 && S2 >= n - p2 && S1 + S2 >= n + p2 - p1) flag = true;
			if (flag) r = mid;
			else l = mid;
		}
		printf("%.10lf\n", l);
	}
	return 0;
}