#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int P = 998244353;

int t;
int m, a, b, c, d;
ll n;

int l = 0;
int p[20], s[20];

int p_Pow(int x, int y) {
	int r = 1;
	for (; y; y >>= 1, x = 1ll * x * x % P) if (y & 1) r = 1ll * r * x % P;
	return r;
}
ll Pow(int x, int y) {
	ll r = 1;
	while (y--) r *= x;
	return r;
}

int ans = 0;
void dfs(int k = 1, int d = 1, int phi = 1) {
	if (d % 2 == 0) return;
	if (k > l) {
		ans = (ans + 1ll * p_Pow(2, n * (m / d) % (P - 2)) * phi) % P;
		return;
	}
	for (int i = 0; i <= s[k]; ++i, d *= p[k], phi *= (p[k] - (i == 1))) dfs(k + 1, d, phi);
}

int main() {
	cin >> t;
	
	while (t--) {
		cin >> m >> a >> b >> c >> d;
		
		ll L = (a && b) ? Pow(m, __gcd(a, b)) + 1 : 1;
		ll R = (c && d) ? Pow(m, __gcd(c, d)) : 0;	
		n = (R - L + 1) / m;
		
		l = 0; int x = m;
		for (int i = 2; i * i <= x; ++i) if (x % i == 0) {
			p[++l] = i, s[l] = 0;
			while (x % i == 0) ++s[l], x /= i;
		}
		if (x > 1) p[++l] = x, s[l] = 1;
		
		ans = 0;
		dfs();
		ans = 1ll * ans * p_Pow(m, P - 2) % P;
		cout << ans << '\n';
	}
	
	return 0;
}