#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint;

vector<vector<mint>> mul(vector<vector<mint>> l, vector<vector<mint>> r){
    vector res(2, vector<mint>(2));
    rep(i, 0, 2) rep(j, 0, 2) rep(k, 0, 2){
        res[i][k] += l[i][j] * r[j][k];
    }
    return res;
}

vector<vector<mint>> inv(vector<vector<mint>> l){
    mint S = l[0][0] * l[1][1] - l[0][1] * l[1][0];
    swap(l[0][0], l[1][1]);
    l[0][1] *= -1;
    l[1][0] *= -1;
    S = S.inv();
    rep(i, 0, 2) rep(j, 0, 2){
        l[i][j] *= S;
    }
    return l;
}

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int P;
    cin >> P;
    mint::set_mod(P);
    vector A(2, vector<mint>(2)), B(2, vector<mint>(2));
    rep(i, 0, 2) rep(j, 0, 2){
        int a;
        cin >> a;
        A[i][j] = a;
    }
    rep(i, 0, 2) rep(j, 0, 2){
        int a;
        cin >> a;
        B[i][j] = a;
    }
    vector<vector<mint>> C = {{1, 0}, {0, 1}};
    const ll D = 400'000;
    map<tuple<int, int, int, int>, int> m;

    auto M = C;
    rep(i, 0, D) {
        if (M == B){
            cout << i << "\n";
            return;
        }
        tuple<int, int, int, int> tmp = {M[0][0].val(), M[0][1].val(), M[1][0].val(), M[1][1].val()};
        if (!m.count(tmp)) m[tmp] = i;
        M = mul(M, A);
    }
    {
        auto X = A[0][0] * A[1][1] - A[0][1] * A[1][0];
        if (X.val() == 0){
            cout << "-1\n";
            return;
        }
    }
    M = inv(M);
    rep(i, 0, D){
        tuple<int, int, int, int> tmp = {B[0][0].val(), B[0][1].val(), B[1][0].val(), B[1][1].val()};
        if (m.count(tmp)) {
            cout << (ll) (i) * D + m[tmp] << "\n";
            return;
        }
        B = mul(M, B);
    }
    cout << "-1\n";
}