#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
ll p;
using arr=array<ll, 2>;
using Mat=array<arr, 2>;
Mat matmul(Mat a, Mat b){
	Mat c={};
	for(int i=0; i<2; i++){
		for(int j=0; j<2; j++){
			for(int k=0; k<2; k++){
				(c[i][j]+=a[i][k]*b[k][j])%=p;
			}
		}
	}
	return c;
}
Mat matpow(Mat a, ll k){
	Mat ap=a, ans={};
	ans[0][0]=ans[1][1]=1;
	while(k){
		if(k&1) ans=matmul(ap, ans);
		ap=matmul(ap, ap);
		k>>=1;
	}
	return ans;
}
Mat e, ainv;
ll matlog(Mat a, Mat b, ll d){
	ll sq=1;
	while(sq*sq<d) sq++;
	vector<pair<Mat, int>> vp(sq);
	vp[0]=make_pair(e, 0);
	for(int i=1; i<sq; i++){
		vp[i]=make_pair(matmul(vp[i-1].first, a), i);
	}
	auto cp=[](pair<Mat, int> x, pair<Mat, int> y){
		for(int i=0; i<2; i++){
			for(int j=0; j<2; j++){
				if(x.first[i][j]!=y.first[i][j]) return x.first[i][j]<y.first[i][j];
			}
		}
		return false;
	};
	sort(vp.begin(), vp.end(), cp);
	Mat ap=matpow(ainv, sq);
	for(int i=0; i<sq; i++){
		int t=lower_bound(vp.begin(), vp.end(), make_pair(b, 0), cp)-vp.begin();
		if(t<sq && vp[t].first==b){
			if(i*sq+vp[t].second<d){
                if(i==0 && vp[t].second==0){
                    if(t+1<sq && vp[t].first==vp[t+1].first) return vp[t+1].second;
                }else{
                    return i*sq+vp[t].second;
                }
            }
		}
		b=matmul(b, ap);
	}
	return -1;
}
ll gcd(ll a, ll b){
    if(b==0) return a;
    return gcd(b, a%b);
}
ll powmod(ll a, ll k, ll mod){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=mod;
        }
        ap=ap*ap;
        ap%=mod;
        k>>=1;
    }
    return ans;
}
ll inv(ll a, ll m){
    ll b=m, x=1, y=0;
    while(b>0){
        ll t=a/b;
        swap(a-=t*b, b);
        swap(x-=t*y, y);
    }
    return (x%m+m)%m;
}
ll discretelog(ll x, ll y, ll m){
    ll p=1%m;
    for(int i=0; i<=30; i++){
        if(p==y) return i;
        (p*=x)%=m;
    }
    ll g=gcd(x, m);
    ll m1=m;
    for(ll i=2; i*i<=g; i++){
        if(g%i==0){
            while(g%i==0) g/=i;
            while(m1%i==0) m1/=i;
        }
    }
    if(g>1){
        while(m1%g==0) m1/=g;
    }
    if(y%(m/m1)!=0) return -1;
    x%=m1, y%=m1;
    ll d=1;
    while(d*d<m1) d++;
    ll invx=inv(x, m1);
    unordered_map<ll, ll> mp; //yx^(-b)
    ll y1=y;
    for(ll i=0; i<d; i++){
        mp[y1]=i;
        (y1*=invx)%=m1;
        if(y1==y) break;
    }
    ll xd=powmod(x, d, m1);
    ll q=1%m1;
    for(ll i=0; i<d; i++){
        auto itr=mp.find(q);
        if(itr!=mp.end()){
            return i*d+itr->second;
        }
        (q*=xd)%=m1;
    }
    return -1;
}
ll order(ll a){
    if(a==1) return 1;
    return discretelog(a, inv(a, p), p)+1;
}
int main()
{
	cin>>p;
	Mat a, b;
	cin>>a[0][0]>>a[0][1]>>a[1][0]>>a[1][1]>>b[0][0]>>b[0][1]>>b[1][0]>>b[1][1];
	if(a==b){
		cout<<1<<endl;
		return 0;
	}
	Mat a2=matmul(a, a);
	if(a2==b){
		cout<<2<<endl;
		return 0;
	}
	if(a2[0][0]==0 && a2[0][1]==0 && a2[1][0]==0 && a2[1][1]==0){
		cout<<-1<<endl;
		return 0;
	}
    ll ad=(a[0][0]*a[1][1]-a[0][1]*a[1][0]%p+p)%p, bd=(b[0][0]*b[1][1]-b[0][1]*b[1][0]%p+p)%p;
	if(ad==0){
		e=matpow(a, p-1), ainv=matpow(a, p-2);
        ll n=matlog(a, b, p);
        if(n==-1){
            cout<<-1<<endl;
            return 0;
        }
        if(matpow(a, n)==b) cout<<n<<endl;
        else cout<<-1<<endl;
        return 0;
	}else{
		e[0][0]=e[1][1]=1;
        if(matpow(a, p*p-1)==e) ainv=matpow(a, p*p-2);
        else ainv=matpow(a, p*(p-1)-1);
	}
	ll r=discretelog(ad, bd, p), m=order(ad);
    if(r==-1){
        cout<<-1<<endl;
        return 0;
    }
    Mat ap=matpow(a, m), c=matmul(b, matpow(ainv, r));
    ainv=matpow(ainv, m);
    ll q=matlog(ap, c, 2*p+1);
    if(q==-1){
        cout<<-1<<endl;
        return 0;
    }
    if(matpow(a, q*m+r)==b) cout<<q*m+r<<endl;
    else cout<<-1<<endl;
	return 0;
}