#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 998244353;
const ll INF = 2e18;
ll gcd(ll x,ll y){return y == 0 ? x : gcd(y,x % y);}
ll ksm(ll x,ll b,ll p = MOD){ll ret = 1;while(b){if(b & 1)ret = ret * x % p;x = x * x % p;b >>= 1;}return ret;}
int main(){
	//freopen("calculate.in","r",stdin);
	//freopen("calculate.out","w",stdout);
	int T;
	cin >> T;
	while(T--){
		ll m,a,b,c,d;
		cin >> m >> a >> b >> c >> d;
		ll L = ksm(m,gcd(a,b),INF) + 1,R = ksm(m,gcd(c,d),INF);
		if(a == 0 || b == 0)L = 1;
		if(c == 0 || d == 0)R = 0;
		ll len = R - L + 1;
		//cerr << L << ' ' << R << '\n';
		//cerr << "len = " << len << '\n';
		if(m & 1)cout << ((m - 1) * ksm(2,len / m) % MOD + ksm(2,len)) % MOD * ksm(m,MOD - 2) % MOD << '\n';
		else cout << ksm(2,len) % MOD * ksm(m,MOD - 2) % MOD << '\n';
	}
	return 0;
}
// (m - 1) 2 ^ (n / m) + 2 ^ n / m