#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
vector<vector<ll>> matmul(vector<vector<ll>> a,vector<vector<ll>> b){
    ll n=a.size();
    vector<vector<ll>> ret;
    vector<ll> e;
    rep(i,0,n)e.push_back(0);
    rep(i,0,n)ret.push_back(e);
    rep(i,0,n){
        rep(j,0,n){
            ll sum=0;
            rep(k,0,n){
                sum+=(a[i][k]*b[k][j])%mod;
                sum%=mod;
            }
            ret[i][j]=sum;
        }
    }
    return ret;
}
vector<vector<ll>> matbeki(vector<vector<ll>> a,ll n){
    vector<vector<ll>> ret;
    ll m=a.size();
    vector<ll> e;
    rep(i,0,m)e.push_back(0);
    rep(i,0,m)ret.push_back(e);
    rep(i,0,m){
        rep(j,0,m){
            if(i==j)ret[i][j]=1;
            else ret[i][j]=0;
        }
    }
    
    while(n>0){
        if(n%2){
            ret=matmul(ret,a);
            
        }
        a=matmul(a,a);
        n/=2;
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    
    ll p;cin>>p;
    mod=p;
    vector<vector<ll>> a,b;
    rep(i,0,2){
        vector<ll> v;
        rep(j,0,2){
            ll r;cin>>r;
            v.push_back(r);
        }
        a.push_back(v);
    }
    rep(i,0,2){
        vector<ll> v;
        rep(j,0,2){
            ll r;
            cin>>r;
            v.push_back(r);
        }
        b.push_back(v);
    }
    if(a[0][0]*a[1][1]-a[0][1]*a[1][0]!=0){
        ll u=a[0][0]*a[1][1]-a[0][1]*a[1][0];
        vector<vector<ll>> c;
        
        u=gyaku(u,mod);
        c={{(u*a[1][1])%mod,(u*(-a[0][1]+mod))%mod},
            {(u*(-a[1][0]+mod))%mod,(u*a[0][0])%mod}};
        ll m=1;
        while(m*m<2000000010)m++;
        map<vector<vector<ll>>,ll> mp;
        vector<vector<ll>> now={{1,0},{0,1}};
        rep(i,0,m){
            if(mp[now]==0)
            mp[now]=i+1;
            now=matmul(now,a);
        }
        vector<vector<ll>> g=b;
        c=matbeki(c,m);
        ll ans=inf;
        rep(i,0,m){
            if(mp[g]!=0){
                ans=min(ans,i*m+mp[g]-1);
            }
            g=matmul(g,c);
        }
        if(ans==inf)cout<<-1<<endl;
        else cout<<ans<<endl;
    }
    else{
        if(a[0][0]+a[1][1]==0){
            vector<vector<ll>> k={{0,0},{0,0}};
            if(b==k){
                if(a==k)cout<<1<<endl;
                else cout<<2<<endl;
                return 0;
            }
            if(a==b){
                cout<<1<<endl;
                return 0;
            }
            cout<<-1<<endl;
            return 0;
        }
        ll m=1;
        while(m*m<2000000010)m++;
        map<ll,ll> mp;
        ll now=1;
        rep(i,0,m){
            mp[now]=i+1;
            now*=(a[0][0]+a[1][1]);
            now%=mod;
        }
        ll h=-1,w=-1;
        rep(i,0,2){
            rep(j,0,2){
                if(a[i][j]!=0){
                    h=i;
                    w=j;
                    break;
                }
            }
            if(h>=0)break;
        }
        if(h==-1&&w==-1){
            if(a==b){
                cout<<1<<endl;
                return 0;
            }
        }
        ll g=b[h][w]*gyaku(a[h][w],mod);
        g%=mod;
        vector<ll> v;
        ll uu=gyaku(a[0][0]+a[1][1],mod);
        uu=beki(uu,m,mod);
        rep(i,0,m){
            if(mp[g]!=0){
                v.push_back(i*m+mp[g]-1);
            }
            g=g*uu;
            g%=mod;
        }
        rep(i,0,v.size()){
            vector<vector<ll>> f=a;
            f=matbeki(f,v[i]);
            if(f==b){
                cout<<v[i]<<endl;
                return 0;
            }
        }
        cout<<-1<<endl;
        return 0;
    }
}