#include using namespace std; long long mod = 998244353; struct Mint { long long v; Mint(long long a = 0) : v((a %= mod) < 0 ? a + mod : a) {} Mint& operator*=(Mint r) { v = (long long)v * r.v % mod; return *this; } Mint& operator/=(Mint r) { return *this *= r.inv(); } Mint& operator+=(Mint r) { if ((v += r.v) >= mod) v -= mod; return *this; } Mint& operator-=(Mint r) { if ((v -= r.v) < 0) v += mod; return *this; } friend Mint operator*(Mint l, Mint r) { return l *= r; } friend Mint operator/(Mint l, Mint r) { return l /= r; } friend Mint operator+(Mint l, Mint r) { return l += r; } friend Mint operator-(Mint l, Mint r) { return l -= r; } Mint pow(long long n) const { assert(n >= 0); Mint res = 1; for (Mint t = *this; n; t *= t, n >>= 1) if (n & 1) res *= t; return res; } Mint inv() const { assert(v); return pow(mod - 2); } friend string to_string(Mint a) { return to_string(a.v); } }; bool operator==(Mint l, Mint r) { return l.v == r.v; } using Mat = array< array, 2 >; const Mat I{1, 0, 0, 1}; Mat operator*(Mat A, Mat B) { Mat res; for (int i : {0, 1}) { for (int k : {0, 1}) { for (int j : {0, 1}) { res[i][j] += A[i][k] * B[k][j]; } } } return res; } Mat& operator*=(Mat& A, Mat B) { return A = A * B; } Mat pow(Mat A, long long n) { Mat res = I; while (n) { if (n & 1) { res *= A; } A *= A; n >>= 1; } return res; } istream& operator>>(istream& is, Mat& A) { for (int i : {0, 1}) { for (int j : {0, 1}) { is >> A[i][j].v; } } return is; } struct Stopwatch { clock_t t = clock(); void restart() { t = clock(); } int elapsed() const { return (clock() - t) * 1000 / CLOCKS_PER_SEC; } friend string to_string(Stopwatch sw) { return "Time: " + to_string(sw.elapsed()) + " ms"; } }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cin >> mod; Mat A, B; cin >> A >> B; auto C = A; int n = 1; for (Stopwatch sw; sw.elapsed() < 100; ) { if (B == C) { cout << n << '\n'; return 0; } C *= A; ++n; } if (n > mod * mod) { cout << "-1\n"; return 0; } assert(false); }