#include "bits/stdc++.h"

#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=n; i--)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a, b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

struct CRT {
    vector<pair<ll, ll>> v;
    void add(ll a, ll m) { v.push_back({ a, m }); } // x = a (mod m)

    set<ll> enumpr(ll n) { set<ll> V;
        for (ll i = 2; i*i <= n; i++) while (n%i == 0) V.insert(i), n /= i;
        if (n>1) V.insert(n); return V; }
    ll ext_gcd(ll p, ll q, ll& x, ll& y) {
        if (q == 0) return x = 1, y = 0, p; ll g = ext_gcd(q, p%q, y, x); y -= p / q*x; return g; }
    ll inv(ll p, ll q) { ll xx, yy, g = ext_gcd(p, q, xx, yy); if (xx<0) xx += q, yy -= p; return xx; }

    ll solve(ll mo = 1000000007) {
        string s; int N = v.size(); set<ll> P; vector<int> num;
        REP(i, 0, N) { set<ll> S = enumpr(v[i].second); for(ll r : S) P.insert(r);}
        num = vector<int>(N, 0);
        for(ll r : P) { int y = 0;
            REP(x, 0, N) { num[x] = 1; int j = v[x].second; while (j%r == 0) j /= r, num[x] *= r;
                if (num[y]<num[x]) y = x; }
            REP(x, 0, N) if (x != y) {
                if (v[x].first%num[x] != v[y].first%num[x]) return -1;
                v[x].second /= num[x]; v[x].first %= v[x].second; } }
        vector<pair<ll, ll> > V2;
        REP(x, 0, N) if (v[x].second>1) V2.emplace_back(v[x].second, v[x].first);
        sort(V2.begin(), V2.end()); v = V2; N = v.size();
        REP(y, 0, N) REP(x, 0, y) { ll k = v[y].second - v[x].second; if (k<0) k += v[y].first;
            v[y].second = k*inv(v[x].first, v[y].first) % v[y].first; }
        ll ret = 0; for (int x = N - 1; x >= 0; x--) ret = (ret*v[x].first + v[x].second) % mo;
        return ret;
    }
};
ll gcd(ll a, ll b) { return a ? gcd(b%a, a) : b; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll X[3], Y[3];
int main() {
    CRT crt;
    REP(i,0,3){
        cin>>X[i]>>Y[i];
        crt.add(X[i],Y[i]);
    }
    ll ans=crt.solve(inf);
    if (ans == 0) ans = lcm(Y[0], lcm(Y[1], Y[2]));
    p(ans);
}